./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_022ebdee-4ba5-46d8-8f02-db44aa74e2f2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_022ebdee-4ba5-46d8-8f02-db44aa74e2f2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_022ebdee-4ba5-46d8-8f02-db44aa74e2f2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_022ebdee-4ba5-46d8-8f02-db44aa74e2f2/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_022ebdee-4ba5-46d8-8f02-db44aa74e2f2/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_022ebdee-4ba5-46d8-8f02-db44aa74e2f2/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 25885afdfdd91cf9312b78ad87a032f4ef31fe0c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 06:41:56,813 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 06:41:56,815 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 06:41:56,823 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 06:41:56,823 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 06:41:56,824 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 06:41:56,825 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 06:41:56,826 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 06:41:56,827 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 06:41:56,828 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 06:41:56,828 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 06:41:56,828 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 06:41:56,829 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 06:41:56,830 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 06:41:56,831 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 06:41:56,831 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 06:41:56,832 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 06:41:56,833 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 06:41:56,834 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 06:41:56,835 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 06:41:56,836 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 06:41:56,837 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 06:41:56,838 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 06:41:56,838 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 06:41:56,838 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 06:41:56,839 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 06:41:56,840 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 06:41:56,840 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 06:41:56,841 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 06:41:56,842 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 06:41:56,842 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 06:41:56,842 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 06:41:56,842 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 06:41:56,843 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 06:41:56,843 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 06:41:56,844 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 06:41:56,844 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_022ebdee-4ba5-46d8-8f02-db44aa74e2f2/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 06:41:56,855 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 06:41:56,855 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 06:41:56,856 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 06:41:56,856 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 06:41:56,856 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 06:41:56,856 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 06:41:56,856 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 06:41:56,856 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 06:41:56,857 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 06:41:56,857 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 06:41:56,857 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 06:41:56,857 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 06:41:56,857 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 06:41:56,857 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 06:41:56,857 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 06:41:56,858 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 06:41:56,858 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 06:41:56,858 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 06:41:56,858 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 06:41:56,858 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 06:41:56,858 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 06:41:56,858 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 06:41:56,858 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 06:41:56,859 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 06:41:56,859 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 06:41:56,859 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 06:41:56,859 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 06:41:56,859 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 06:41:56,860 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 06:41:56,860 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_022ebdee-4ba5-46d8-8f02-db44aa74e2f2/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 -> 25885afdfdd91cf9312b78ad87a032f4ef31fe0c [2018-12-09 06:41:56,882 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 06:41:56,888 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 06:41:56,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 06:41:56,891 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 06:41:56,891 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 06:41:56,892 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_022ebdee-4ba5-46d8-8f02-db44aa74e2f2/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-12-09 06:41:56,926 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_022ebdee-4ba5-46d8-8f02-db44aa74e2f2/bin-2019/uautomizer/data/b77101641/6c77a9f2f46d43b6a61ccbc0c932a5a4/FLAG7ffe58357 [2018-12-09 06:41:57,337 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 06:41:57,338 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_022ebdee-4ba5-46d8-8f02-db44aa74e2f2/sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-12-09 06:41:57,343 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_022ebdee-4ba5-46d8-8f02-db44aa74e2f2/bin-2019/uautomizer/data/b77101641/6c77a9f2f46d43b6a61ccbc0c932a5a4/FLAG7ffe58357 [2018-12-09 06:41:57,354 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_022ebdee-4ba5-46d8-8f02-db44aa74e2f2/bin-2019/uautomizer/data/b77101641/6c77a9f2f46d43b6a61ccbc0c932a5a4 [2018-12-09 06:41:57,356 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 06:41:57,357 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 06:41:57,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 06:41:57,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 06:41:57,359 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 06:41:57,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:41:57" (1/1) ... [2018-12-09 06:41:57,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58dfd927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:57, skipping insertion in model container [2018-12-09 06:41:57,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:41:57" (1/1) ... [2018-12-09 06:41:57,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 06:41:57,390 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 06:41:57,530 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 06:41:57,537 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 06:41:57,592 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 06:41:57,611 INFO L195 MainTranslator]: Completed translation [2018-12-09 06:41:57,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:57 WrapperNode [2018-12-09 06:41:57,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 06:41:57,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 06:41:57,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 06:41:57,612 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 06:41:57,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:57" (1/1) ... [2018-12-09 06:41:57,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:57" (1/1) ... [2018-12-09 06:41:57,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 06:41:57,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 06:41:57,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 06:41:57,638 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 06:41:57,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:57" (1/1) ... [2018-12-09 06:41:57,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:57" (1/1) ... [2018-12-09 06:41:57,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:57" (1/1) ... [2018-12-09 06:41:57,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:57" (1/1) ... [2018-12-09 06:41:57,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:57" (1/1) ... [2018-12-09 06:41:57,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:57" (1/1) ... [2018-12-09 06:41:57,651 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:57" (1/1) ... [2018-12-09 06:41:57,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 06:41:57,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 06:41:57,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 06:41:57,652 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 06:41:57,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_022ebdee-4ba5-46d8-8f02-db44aa74e2f2/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 06:41:57,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 06:41:57,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 06:41:57,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 06:41:57,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 06:41:57,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 06:41:57,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 06:41:57,844 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 06:41:57,844 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-09 06:41:57,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:41:57 BoogieIcfgContainer [2018-12-09 06:41:57,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 06:41:57,845 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 06:41:57,845 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 06:41:57,847 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 06:41:57,848 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 06:41:57,848 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 06:41:57" (1/3) ... [2018-12-09 06:41:57,848 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@569a3b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 06:41:57, skipping insertion in model container [2018-12-09 06:41:57,848 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 06:41:57,849 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:57" (2/3) ... [2018-12-09 06:41:57,849 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@569a3b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 06:41:57, skipping insertion in model container [2018-12-09 06:41:57,849 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 06:41:57,849 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:41:57" (3/3) ... [2018-12-09 06:41:57,850 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-12-09 06:41:57,888 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 06:41:57,888 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 06:41:57,888 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 06:41:57,888 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 06:41:57,888 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 06:41:57,888 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 06:41:57,889 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 06:41:57,889 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 06:41:57,889 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 06:41:57,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-09 06:41:57,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 06:41:57,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:41:57,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:41:57,916 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 06:41:57,916 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 06:41:57,916 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 06:41:57,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-09 06:41:57,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 06:41:57,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:41:57,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:41:57,917 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 06:41:57,917 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 06:41:57,922 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 6#L555true assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 10#L555-2true assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 7#L558-3true [2018-12-09 06:41:57,922 INFO L796 eck$LassoCheckResult]: Loop: 7#L558-3true call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 4#L558-1true assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 16#L559true assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 5#L559-2true call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 7#L558-3true [2018-12-09 06:41:57,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:41:57,926 INFO L82 PathProgramCache]: Analyzing trace with hash 925673, now seen corresponding path program 1 times [2018-12-09 06:41:57,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:41:57,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:41:57,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:41:57,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:41:57,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:41:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:41:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:41:58,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:41:58,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1482703, now seen corresponding path program 1 times [2018-12-09 06:41:58,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:41:58,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:41:58,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:41:58,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:41:58,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:41:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:41:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:41:58,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:41:58,033 INFO L82 PathProgramCache]: Analyzing trace with hash 180521911, now seen corresponding path program 1 times [2018-12-09 06:41:58,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:41:58,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:41:58,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:41:58,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:41:58,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:41:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:41:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:41:58,395 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 97 [2018-12-09 06:41:58,481 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 06:41:58,482 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 06:41:58,482 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 06:41:58,482 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 06:41:58,482 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 06:41:58,482 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 06:41:58,482 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 06:41:58,482 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 06:41:58,483 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-12-09 06:41:58,483 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 06:41:58,483 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 06:41:58,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:41:58,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:41:58,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:41:58,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:41:58,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:41:58,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:41:58,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:41:58,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:41:58,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:41:58,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:41:58,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:41:58,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:41:58,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:41:58,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:41:58,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:41:58,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:41:58,735 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2018-12-09 06:41:58,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:41:58,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:41:58,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:41:58,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:41:58,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:41:58,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:41:59,133 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 06:41:59,136 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 06:41:59,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:41:59,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:41:59,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:41:59,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:41:59,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:41:59,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:41:59,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:41:59,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:41:59,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:41:59,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:41:59,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:41:59,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:41:59,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:41:59,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:41:59,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:41:59,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:41:59,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:41:59,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:41:59,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:41:59,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:41:59,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:41:59,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:41:59,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:41:59,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:41:59,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:41:59,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:41:59,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:41:59,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:41:59,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:41:59,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:41:59,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:41:59,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:41:59,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:41:59,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:41:59,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:41:59,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:41:59,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:41:59,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:41:59,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:41:59,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:41:59,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:41:59,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:41:59,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:41:59,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:41:59,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:41:59,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:41:59,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:41:59,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:41:59,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:41:59,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:41:59,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:41:59,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:41:59,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:41:59,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:41:59,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:41:59,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:41:59,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:41:59,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:41:59,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:41:59,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:41:59,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:41:59,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:41:59,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:41:59,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:41:59,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:41:59,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:41:59,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:41:59,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:41:59,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:41:59,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:41:59,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-12-09 06:41:59,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:41:59,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:41:59,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:41:59,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:41:59,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:41:59,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:41:59,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:41:59,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:41:59,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:41:59,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:41:59,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:41:59,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:41:59,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:41:59,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:41:59,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:41:59,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:41:59,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:41:59,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:41:59,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:41:59,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:41:59,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:41:59,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:41:59,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:41:59,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:41:59,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:41:59,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-12-09 06:41:59,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:41:59,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:41:59,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:41:59,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:41:59,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:41:59,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:41:59,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:41:59,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:41:59,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:41:59,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:41:59,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:41:59,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:41:59,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:41:59,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:41:59,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:41:59,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:41:59,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:41:59,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:41:59,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:41:59,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:41:59,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:41:59,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:41:59,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:41:59,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:41:59,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:41:59,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:41:59,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:41:59,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:41:59,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:41:59,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:41:59,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:41:59,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:41:59,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:41:59,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:41:59,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:41:59,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:41:59,176 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:41:59,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:41:59,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:41:59,177 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:41:59,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:41:59,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:41:59,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:41:59,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:41:59,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:41:59,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:41:59,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:41:59,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:41:59,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:41:59,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:41:59,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:41:59,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:41:59,193 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:41:59,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:41:59,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:41:59,194 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:41:59,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:41:59,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:41:59,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:41:59,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:41:59,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:41:59,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:41:59,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:41:59,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:41:59,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:41:59,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:41:59,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:41:59,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:41:59,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:41:59,203 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 06:41:59,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:41:59,207 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-09 06:41:59,207 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-09 06:41:59,256 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 06:41:59,300 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 06:41:59,300 INFO L444 ModelExtractionUtils]: 34 out of 46 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-12-09 06:41:59,302 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 06:41:59,304 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-12-09 06:41:59,305 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 06:41:59,305 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-12-09 06:41:59,371 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-09 06:41:59,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 06:41:59,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 06:41:59,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:41:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:41:59,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:41:59,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2018-12-09 06:41:59,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:41:59,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:41:59,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 46 [2018-12-09 06:41:59,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-12-09 06:41:59,493 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:41:59,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-12-09 06:41:59,520 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 06:41:59,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-12-09 06:41:59,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-09 06:41:59,547 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 06:41:59,551 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:41:59,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-12-09 06:41:59,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2018-12-09 06:41:59,558 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-09 06:41:59,566 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 06:41:59,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-12-09 06:41:59,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-12-09 06:41:59,598 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 06:41:59,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-12-09 06:41:59,611 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 06:41:59,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2018-12-09 06:41:59,626 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-09 06:41:59,635 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 06:41:59,659 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 06:41:59,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 06:41:59,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 06:41:59,692 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:71, output treesize:10 [2018-12-09 06:41:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:41:59,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:41:59,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:41:59,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2018-12-09 06:41:59,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-12-09 06:41:59,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:41:59,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:41:59,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:41:59,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 45 [2018-12-09 06:41:59,770 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 06:41:59,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 06:41:59,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 06:41:59,789 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:46, output treesize:50 [2018-12-09 06:41:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:41:59,815 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-12-09 06:41:59,816 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 7 states. [2018-12-09 06:41:59,881 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 7 states. Result 37 states and 45 transitions. Complement of second has 8 states. [2018-12-09 06:41:59,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 06:41:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 06:41:59,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-12-09 06:41:59,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 4 letters. Loop has 4 letters. [2018-12-09 06:41:59,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:41:59,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-09 06:41:59,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:41:59,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 4 letters. Loop has 8 letters. [2018-12-09 06:41:59,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:41:59,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 45 transitions. [2018-12-09 06:41:59,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 06:41:59,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 18 states and 22 transitions. [2018-12-09 06:41:59,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-09 06:41:59,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-09 06:41:59,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2018-12-09 06:41:59,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 06:41:59,892 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-12-09 06:41:59,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2018-12-09 06:41:59,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-12-09 06:41:59,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-09 06:41:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-12-09 06:41:59,908 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-12-09 06:41:59,908 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-12-09 06:41:59,908 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 06:41:59,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-12-09 06:41:59,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 06:41:59,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:41:59,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:41:59,909 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 06:41:59,909 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 06:41:59,909 INFO L794 eck$LassoCheckResult]: Stem: 211#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 207#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 208#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 209#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 210#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 216#L558-1 [2018-12-09 06:41:59,909 INFO L796 eck$LassoCheckResult]: Loop: 216#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 217#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 220#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 212#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 213#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 216#L558-1 [2018-12-09 06:41:59,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:41:59,909 INFO L82 PathProgramCache]: Analyzing trace with hash 28695881, now seen corresponding path program 1 times [2018-12-09 06:41:59,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:41:59,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:41:59,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:41:59,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:41:59,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:41:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:41:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:41:59,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:41:59,929 INFO L82 PathProgramCache]: Analyzing trace with hash 50737098, now seen corresponding path program 1 times [2018-12-09 06:41:59,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:41:59,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:41:59,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:41:59,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:41:59,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:41:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:41:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:41:59,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:41:59,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1682923394, now seen corresponding path program 1 times [2018-12-09 06:41:59,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:41:59,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:41:59,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:41:59,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:41:59,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:41:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:41:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:42:00,217 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 99 [2018-12-09 06:42:00,284 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 06:42:00,284 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 06:42:00,284 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 06:42:00,284 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 06:42:00,284 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 06:42:00,284 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 06:42:00,284 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 06:42:00,284 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 06:42:00,284 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-12-09 06:42:00,284 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 06:42:00,285 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 06:42:00,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:00,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:00,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:00,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:00,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:00,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:00,456 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2018-12-09 06:42:00,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:00,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:00,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:00,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:00,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:00,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:00,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:00,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:00,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:00,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:00,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:00,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:00,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:00,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:00,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:00,853 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 06:42:00,854 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 06:42:00,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:00,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:00,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:42:00,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:00,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:00,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:00,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:42:00,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:42:00,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:00,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-12-09 06:42:00,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:00,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:42:00,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:00,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:00,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:00,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:42:00,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:42:00,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:00,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:00,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:00,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:00,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:00,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:00,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:42:00,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:42:00,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:00,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:00,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:00,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:00,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:00,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:00,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:42:00,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:42:00,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:00,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:00,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:00,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:42:00,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:00,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:00,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:00,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:42:00,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:42:00,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:00,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:00,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:00,868 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:42:00,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:00,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:00,869 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:42:00,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:42:00,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:00,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:00,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:00,874 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:42:00,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:00,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:00,875 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:42:00,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:42:00,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:00,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:00,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:00,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:00,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:00,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:00,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:42:00,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:42:00,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:00,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:00,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:00,884 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:42:00,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:00,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:00,885 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:42:00,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:42:00,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:00,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:00,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:00,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:00,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:00,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:00,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:42:00,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:42:00,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:00,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:00,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:00,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:00,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:00,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:00,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:42:00,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:42:00,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:00,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:00,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:00,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:00,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:00,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:00,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:42:00,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:42:00,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:00,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:00,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:00,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:00,902 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 06:42:00,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:00,906 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-09 06:42:00,906 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-09 06:42:00,938 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 06:42:00,957 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-09 06:42:00,957 INFO L444 ModelExtractionUtils]: 43 out of 51 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-09 06:42:00,957 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 06:42:00,958 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-12-09 06:42:00,958 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 06:42:00,959 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2018-12-09 06:42:01,029 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-09 06:42:01,030 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 06:42:01,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:42:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:42:01,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:42:01,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:01,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2018-12-09 06:42:01,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:01,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-12-09 06:42:01,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:01,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2018-12-09 06:42:01,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:42:01,082 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:01,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 46 [2018-12-09 06:42:01,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-12-09 06:42:01,126 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 06:42:01,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-12-09 06:42:01,151 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:01,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-12-09 06:42:01,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 06:42:01,179 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:01,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 06:42:01,183 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:01,187 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:42:01,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-12-09 06:42:01,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-12-09 06:42:01,224 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:01,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2018-12-09 06:42:01,236 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-09 06:42:01,245 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 06:42:01,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-12-09 06:42:01,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-09 06:42:01,265 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:01,269 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:42:01,282 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 06:42:01,294 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 06:42:01,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 06:42:01,310 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:91, output treesize:10 [2018-12-09 06:42:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:42:01,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:42:01,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:01,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-09 06:42:01,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:01,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-09 06:42:01,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:01,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:42:01,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:42:01,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-12-09 06:42:01,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:01,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-12-09 06:42:01,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:01,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-09 06:42:01,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:01,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:42:01,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:42:01,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:21 [2018-12-09 06:42:01,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:42:01,369 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-12-09 06:42:01,369 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-12-09 06:42:01,398 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 37 states and 44 transitions. Complement of second has 8 states. [2018-12-09 06:42:01,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 06:42:01,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 06:42:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-12-09 06:42:01,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 5 letters. [2018-12-09 06:42:01,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:42:01,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 10 letters. Loop has 5 letters. [2018-12-09 06:42:01,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:42:01,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 10 letters. [2018-12-09 06:42:01,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:42:01,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2018-12-09 06:42:01,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 06:42:01,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 25 states and 30 transitions. [2018-12-09 06:42:01,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-09 06:42:01,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-09 06:42:01,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2018-12-09 06:42:01,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 06:42:01,403 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-12-09 06:42:01,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2018-12-09 06:42:01,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-09 06:42:01,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-09 06:42:01,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2018-12-09 06:42:01,404 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-12-09 06:42:01,404 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-12-09 06:42:01,404 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 06:42:01,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2018-12-09 06:42:01,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 06:42:01,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:42:01,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:42:01,406 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:42:01,406 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 06:42:01,406 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 420#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 421#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 422#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 434#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 438#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 437#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 425#L558-3 [2018-12-09 06:42:01,406 INFO L796 eck$LassoCheckResult]: Loop: 425#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 428#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 429#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 432#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 424#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 425#L558-3 [2018-12-09 06:42:01,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:42:01,406 INFO L82 PathProgramCache]: Analyzing trace with hash 180521911, now seen corresponding path program 2 times [2018-12-09 06:42:01,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:42:01,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:42:01,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:42:01,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:42:01,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:42:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:42:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:42:01,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:42:01,421 INFO L82 PathProgramCache]: Analyzing trace with hash 45965688, now seen corresponding path program 2 times [2018-12-09 06:42:01,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:42:01,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:42:01,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:42:01,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:42:01,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:42:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:42:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:42:01,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:42:01,427 INFO L82 PathProgramCache]: Analyzing trace with hash -915687550, now seen corresponding path program 1 times [2018-12-09 06:42:01,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:42:01,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:42:01,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:42:01,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:42:01,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:42:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:42:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:42:01,981 WARN L180 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 116 [2018-12-09 06:42:02,141 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-12-09 06:42:02,143 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 06:42:02,143 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 06:42:02,143 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 06:42:02,143 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 06:42:02,143 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 06:42:02,143 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 06:42:02,143 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 06:42:02,143 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 06:42:02,143 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-12-09 06:42:02,143 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 06:42:02,144 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 06:42:02,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:02,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:02,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:02,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:02,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:02,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:02,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:02,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:02,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:02,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:02,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:02,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:02,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-12-09 06:42:02,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-12-09 06:42:02,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:02,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:02,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:02,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:02,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:02,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:02,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:02,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:42:02,658 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 06:42:02,658 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 06:42:02,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:02,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:02,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:42:02,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:02,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:02,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:02,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:42:02,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:42:02,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:02,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:02,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:02,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:42:02,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:02,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:02,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:02,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:42:02,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:42:02,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:02,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:02,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:02,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:02,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:02,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:02,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:42:02,661 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:42:02,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:02,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:02,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:02,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:02,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:02,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:02,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:42:02,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:42:02,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:02,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:02,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:02,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:42:02,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:02,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:02,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:02,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:42:02,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:42:02,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:02,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:02,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:02,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:42:02,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:02,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:02,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:02,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:42:02,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:42:02,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:02,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:02,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:02,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:02,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:02,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:02,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:42:02,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:42:02,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:02,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:02,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:02,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:42:02,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:02,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:02,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:02,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:42:02,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:42:02,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:02,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:02,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:02,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:42:02,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:02,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:02,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:02,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:42:02,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:42:02,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:02,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:02,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:02,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:42:02,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:02,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:02,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:02,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:42:02,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:42:02,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:02,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:02,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:02,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:42:02,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:02,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:02,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:02,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:42:02,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:42:02,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:02,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:02,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:02,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:42:02,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:02,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:02,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:02,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:42:02,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:42:02,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:02,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:02,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:02,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:02,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:02,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:02,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:42:02,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:42:02,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:02,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:02,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:02,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:02,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:02,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:02,674 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:42:02,674 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:42:02,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:02,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:02,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:02,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:02,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:02,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:02,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:42:02,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:42:02,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:02,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:02,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:02,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:02,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:02,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:02,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:42:02,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:42:02,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:02,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:02,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:02,681 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:42:02,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:02,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:02,682 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:42:02,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:42:02,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:02,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:02,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:02,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:02,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:02,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:02,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:42:02,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:42:02,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:42:02,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:42:02,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:42:02,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:42:02,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:42:02,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:42:02,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:42:02,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:42:02,690 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 06:42:02,694 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-09 06:42:02,694 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-09 06:42:02,694 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 06:42:02,695 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 06:42:02,695 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 06:42:02,695 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2018-12-09 06:42:02,747 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-09 06:42:02,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 06:42:02,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:42:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:42:02,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:42:02,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-09 06:42:02,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:02,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2018-12-09 06:42:02,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:42:02,786 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:02,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 42 [2018-12-09 06:42:02,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-12-09 06:42:02,805 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:02,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-12-09 06:42:02,834 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 06:42:02,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 29 treesize of output 54 [2018-12-09 06:42:02,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 36 [2018-12-09 06:42:02,909 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-12-09 06:42:02,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 36 [2018-12-09 06:42:02,983 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-09 06:42:03,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-09 06:42:03,035 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:03,081 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-09 06:42:03,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-12-09 06:42:03,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-09 06:42:03,156 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:03,174 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 06:42:03,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-12-09 06:42:03,175 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:03,185 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 06:42:03,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 53 [2018-12-09 06:42:03,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-12-09 06:42:03,256 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:03,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 36 [2018-12-09 06:42:03,310 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 3 xjuncts. [2018-12-09 06:42:03,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-12-09 06:42:03,362 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:03,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-12-09 06:42:03,403 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-12-09 06:42:03,430 INFO L267 ElimStorePlain]: Start of recursive call 15: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-09 06:42:03,468 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-09 06:42:03,491 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-09 06:42:03,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-09 06:42:03,515 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 4 variables, input treesize:74, output treesize:85 [2018-12-09 06:42:03,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2018-12-09 06:42:03,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:03,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:03,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-12-09 06:42:03,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:03,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-12-09 06:42:03,632 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:03,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2018-12-09 06:42:03,685 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 06:42:03,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-12-09 06:42:03,766 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:03,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:03,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:03,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-12-09 06:42:03,804 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:03,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-12-09 06:42:03,834 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:03,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-12-09 06:42:03,885 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:03,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:03,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:03,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-09 06:42:03,912 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:03,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-12-09 06:42:03,935 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:03,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 11 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-09 06:42:03,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 06:42:03,971 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:30, output treesize:30 [2018-12-09 06:42:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:42:03,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:42:04,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:04,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-09 06:42:04,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:04,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-09 06:42:04,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:04,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:42:04,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:42:04,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-12-09 06:42:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:42:04,028 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 3 loop predicates [2018-12-09 06:42:04,028 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 8 Second operand 10 states. [2018-12-09 06:42:04,148 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 8. Second operand 10 states. Result 60 states and 72 transitions. Complement of second has 11 states. [2018-12-09 06:42:04,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 06:42:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-09 06:42:04,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2018-12-09 06:42:04,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 5 letters. [2018-12-09 06:42:04,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:42:04,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 13 letters. Loop has 5 letters. [2018-12-09 06:42:04,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:42:04,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 10 letters. [2018-12-09 06:42:04,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:42:04,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 72 transitions. [2018-12-09 06:42:04,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 06:42:04,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 41 states and 49 transitions. [2018-12-09 06:42:04,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-09 06:42:04,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-09 06:42:04,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 49 transitions. [2018-12-09 06:42:04,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 06:42:04,152 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-12-09 06:42:04,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 49 transitions. [2018-12-09 06:42:04,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-12-09 06:42:04,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-09 06:42:04,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-12-09 06:42:04,153 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-12-09 06:42:04,153 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-12-09 06:42:04,153 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 06:42:04,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2018-12-09 06:42:04,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 06:42:04,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:42:04,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:42:04,154 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1] [2018-12-09 06:42:04,154 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 06:42:04,154 INFO L794 eck$LassoCheckResult]: Stem: 689#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 685#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 686#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 687#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 688#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 700#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 709#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 708#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 707#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 705#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 704#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 703#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 695#L558-3 [2018-12-09 06:42:04,154 INFO L796 eck$LassoCheckResult]: Loop: 695#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 690#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 691#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 698#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 694#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 695#L558-3 [2018-12-09 06:42:04,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:42:04,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1969201019, now seen corresponding path program 3 times [2018-12-09 06:42:04,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:42:04,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:42:04,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:42:04,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:42:04,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:42:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:42:04,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:42:04,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:42:04,265 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_022ebdee-4ba5-46d8-8f02-db44aa74e2f2/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 06:42:04,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 06:42:04,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-09 06:42:04,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 06:42:04,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:42:04,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:04,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-09 06:42:04,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:04,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:04,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 06:42:04,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:04,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:42:04,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2018-12-09 06:42:04,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:42:04,351 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:04,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 42 [2018-12-09 06:42:04,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-12-09 06:42:04,369 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:04,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-12-09 06:42:04,392 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:04,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 45 [2018-12-09 06:42:04,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-09 06:42:04,427 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:04,439 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 06:42:04,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-12-09 06:42:04,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:42:04,465 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:04,469 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:42:04,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 42 [2018-12-09 06:42:04,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-12-09 06:42:04,501 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:04,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-12-09 06:42:04,517 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:04,525 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 06:42:04,538 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 06:42:04,555 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 06:42:04,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 06:42:04,571 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:88, output treesize:70 [2018-12-09 06:42:04,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 39 [2018-12-09 06:42:04,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-09 06:42:04,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:04,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:42:04,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:42:04,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-12-09 06:42:04,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:04,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 58 [2018-12-09 06:42:04,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:04,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2018-12-09 06:42:04,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:04,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:04,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-12-09 06:42:04,668 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:04,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 06:42:04,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 06:42:04,688 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:46, output treesize:69 [2018-12-09 06:42:04,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 45 [2018-12-09 06:42:04,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-12-09 06:42:04,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:04,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-09 06:42:04,775 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 06:42:04,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-12-09 06:42:04,787 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 06:42:04,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 06:42:04,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 06:42:04,803 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:17 [2018-12-09 06:42:04,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:42:04,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 06:42:04,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-12-09 06:42:04,832 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 06:42:04,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:42:04,833 INFO L82 PathProgramCache]: Analyzing trace with hash 45965688, now seen corresponding path program 3 times [2018-12-09 06:42:04,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:42:04,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:42:04,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:42:04,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:42:04,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:42:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:42:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:42:04,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 06:42:04,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-09 06:42:04,919 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-12-09 06:42:05,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:42:05,181 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-12-09 06:42:05,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 06:42:05,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 49 transitions. [2018-12-09 06:42:05,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 06:42:05,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 23 states and 26 transitions. [2018-12-09 06:42:05,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-09 06:42:05,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-09 06:42:05,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2018-12-09 06:42:05,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 06:42:05,182 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-09 06:42:05,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2018-12-09 06:42:05,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-12-09 06:42:05,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-09 06:42:05,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-12-09 06:42:05,183 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-12-09 06:42:05,183 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-12-09 06:42:05,183 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 06:42:05,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2018-12-09 06:42:05,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 06:42:05,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:42:05,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:42:05,184 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:42:05,184 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 06:42:05,184 INFO L794 eck$LassoCheckResult]: Stem: 822#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 818#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 819#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 820#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 821#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 825#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 826#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 833#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 829#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 830#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 823#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 824#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 827#L559-2 [2018-12-09 06:42:05,184 INFO L796 eck$LassoCheckResult]: Loop: 827#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 828#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 835#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 834#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 832#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 827#L559-2 [2018-12-09 06:42:05,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:42:05,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1913288219, now seen corresponding path program 2 times [2018-12-09 06:42:05,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:42:05,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:42:05,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:42:05,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:42:05,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:42:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:42:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:42:05,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:42:05,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_022ebdee-4ba5-46d8-8f02-db44aa74e2f2/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 06:42:05,325 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 06:42:05,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 06:42:05,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 06:42:05,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:42:05,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:05,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-09 06:42:05,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:05,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:05,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 06:42:05,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:05,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:42:05,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:42:05,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-12-09 06:42:05,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:05,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2018-12-09 06:42:05,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:05,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-12-09 06:42:05,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:05,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:42:05,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:42:05,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-12-09 06:42:05,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:05,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 48 [2018-12-09 06:42:05,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:42:05,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-09 06:42:05,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:05,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:42:05,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:42:05,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:18 [2018-12-09 06:42:05,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-12-09 06:42:05,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 06:42:05,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:05,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-09 06:42:05,469 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 06:42:05,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:42:05,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:42:05,472 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2018-12-09 06:42:05,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:42:05,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 06:42:05,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-12-09 06:42:05,487 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 06:42:05,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:42:05,487 INFO L82 PathProgramCache]: Analyzing trace with hash 61511628, now seen corresponding path program 4 times [2018-12-09 06:42:05,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:42:05,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:42:05,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:42:05,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:42:05,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:42:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:42:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:42:05,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 06:42:05,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-09 06:42:05,570 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 12 states. [2018-12-09 06:42:05,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:42:05,623 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-12-09 06:42:05,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 06:42:05,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2018-12-09 06:42:05,624 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 06:42:05,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2018-12-09 06:42:05,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 06:42:05,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 06:42:05,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 06:42:05,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 06:42:05,624 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 06:42:05,624 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 06:42:05,624 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 06:42:05,624 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 06:42:05,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 06:42:05,625 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 06:42:05,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 06:42:05,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 06:42:05 BoogieIcfgContainer [2018-12-09 06:42:05,628 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 06:42:05,629 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 06:42:05,629 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 06:42:05,629 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 06:42:05,629 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:41:57" (3/4) ... [2018-12-09 06:42:05,631 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 06:42:05,631 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 06:42:05,632 INFO L168 Benchmark]: Toolchain (without parser) took 8275.07 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 296.7 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -55.7 MB). Peak memory consumption was 241.0 MB. Max. memory is 11.5 GB. [2018-12-09 06:42:05,632 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 06:42:05,632 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 74.4 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -100.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-09 06:42:05,632 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.51 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 06:42:05,633 INFO L168 Benchmark]: Boogie Preprocessor took 14.42 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 06:42:05,633 INFO L168 Benchmark]: RCFGBuilder took 192.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-12-09 06:42:05,633 INFO L168 Benchmark]: BuchiAutomizer took 7783.35 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 222.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24.7 MB). Peak memory consumption was 247.0 MB. Max. memory is 11.5 GB. [2018-12-09 06:42:05,633 INFO L168 Benchmark]: Witness Printer took 2.50 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 06:42:05,635 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 254.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 74.4 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -100.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.51 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.42 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 192.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7783.35 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 222.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24.7 MB). Peak memory consumption was 247.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.50 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.0s. Construction of modules took 0.1s. Büchi inclusion checks took 2.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 29 SDtfs, 111 SDslu, 43 SDs, 0 SdLazy, 179 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital551 mio100 ax104 hnf100 lsp93 ukn46 mio100 lsp38 div100 bol100 ite100 ukn100 eq182 hnf88 smp96 dnf101 smp100 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 102ms VariablesStem: 8 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...