./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Urban-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2c5429d0-1070-4362-b690-83d8f860282f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2c5429d0-1070-4362-b690-83d8f860282f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2c5429d0-1070-4362-b690-83d8f860282f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2c5429d0-1070-4362-b690-83d8f860282f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Urban-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2c5429d0-1070-4362-b690-83d8f860282f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2c5429d0-1070-4362-b690-83d8f860282f/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 9d3cc6bed79d5f36ef86c37a4cddb412902bd9be ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 13:06:04,928 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:06:04,929 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:06:04,936 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:06:04,936 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:06:04,936 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:06:04,937 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:06:04,938 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:06:04,940 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:06:04,940 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:06:04,941 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:06:04,941 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:06:04,942 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:06:04,942 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:06:04,943 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:06:04,943 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:06:04,943 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:06:04,944 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:06:04,946 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:06:04,946 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:06:04,947 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:06:04,948 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:06:04,949 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:06:04,950 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:06:04,950 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:06:04,950 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:06:04,951 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:06:04,951 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:06:04,952 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:06:04,953 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:06:04,953 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:06:04,953 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:06:04,953 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:06:04,954 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:06:04,954 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:06:04,955 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:06:04,955 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2c5429d0-1070-4362-b690-83d8f860282f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 13:06:04,963 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:06:04,963 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:06:04,964 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:06:04,964 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:06:04,964 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:06:04,964 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 13:06:04,964 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 13:06:04,964 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 13:06:04,965 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 13:06:04,965 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 13:06:04,965 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 13:06:04,965 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:06:04,965 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:06:04,965 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:06:04,965 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:06:04,965 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 13:06:04,965 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 13:06:04,965 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 13:06:04,966 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:06:04,966 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 13:06:04,966 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:06:04,966 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 13:06:04,966 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:06:04,966 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:06:04,966 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 13:06:04,967 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:06:04,967 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:06:04,967 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 13:06:04,967 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 13:06:04,968 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_2c5429d0-1070-4362-b690-83d8f860282f/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 -> 9d3cc6bed79d5f36ef86c37a4cddb412902bd9be [2018-11-23 13:06:04,988 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:06:04,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:06:04,998 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:06:04,999 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:06:04,999 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:06:05,000 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2c5429d0-1070-4362-b690-83d8f860282f/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Urban-alloca_true-termination.c.i [2018-11-23 13:06:05,039 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2c5429d0-1070-4362-b690-83d8f860282f/bin-2019/uautomizer/data/a2f5cba30/b1c345d5a01641f093c58241b20cec40/FLAG50efa446e [2018-11-23 13:06:05,416 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:06:05,417 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2c5429d0-1070-4362-b690-83d8f860282f/sv-benchmarks/c/termination-memory-alloca/Urban-alloca_true-termination.c.i [2018-11-23 13:06:05,426 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2c5429d0-1070-4362-b690-83d8f860282f/bin-2019/uautomizer/data/a2f5cba30/b1c345d5a01641f093c58241b20cec40/FLAG50efa446e [2018-11-23 13:06:05,803 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2c5429d0-1070-4362-b690-83d8f860282f/bin-2019/uautomizer/data/a2f5cba30/b1c345d5a01641f093c58241b20cec40 [2018-11-23 13:06:05,805 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:06:05,806 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:06:05,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:06:05,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:06:05,809 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:06:05,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:06:05" (1/1) ... [2018-11-23 13:06:05,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ebb7cd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:05, skipping insertion in model container [2018-11-23 13:06:05,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:06:05" (1/1) ... [2018-11-23 13:06:05,818 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:06:05,844 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:06:06,023 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:06:06,031 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:06:06,057 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:06:06,128 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:06:06,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:06 WrapperNode [2018-11-23 13:06:06,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:06:06,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:06:06,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:06:06,129 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:06:06,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:06" (1/1) ... [2018-11-23 13:06:06,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:06" (1/1) ... [2018-11-23 13:06:06,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:06:06,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:06:06,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:06:06,158 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:06:06,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:06" (1/1) ... [2018-11-23 13:06:06,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:06" (1/1) ... [2018-11-23 13:06:06,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:06" (1/1) ... [2018-11-23 13:06:06,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:06" (1/1) ... [2018-11-23 13:06:06,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:06" (1/1) ... [2018-11-23 13:06:06,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:06" (1/1) ... [2018-11-23 13:06:06,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:06" (1/1) ... [2018-11-23 13:06:06,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:06:06,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:06:06,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:06:06,173 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:06:06,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c5429d0-1070-4362-b690-83d8f860282f/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:06:06,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:06:06,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:06:06,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:06:06,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:06:06,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:06:06,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:06:06,342 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:06:06,343 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 13:06:06,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:06 BoogieIcfgContainer [2018-11-23 13:06:06,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:06:06,343 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 13:06:06,343 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 13:06:06,346 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 13:06:06,346 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:06:06,346 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:06:05" (1/3) ... [2018-11-23 13:06:06,347 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cd4de0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:06:06, skipping insertion in model container [2018-11-23 13:06:06,347 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:06:06,347 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:06" (2/3) ... [2018-11-23 13:06:06,347 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cd4de0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:06:06, skipping insertion in model container [2018-11-23 13:06:06,347 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:06:06,347 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:06" (3/3) ... [2018-11-23 13:06:06,349 INFO L375 chiAutomizerObserver]: Analyzing ICFG Urban-alloca_true-termination.c.i [2018-11-23 13:06:06,384 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:06:06,385 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 13:06:06,385 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 13:06:06,385 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 13:06:06,385 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:06:06,385 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:06:06,385 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 13:06:06,385 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:06:06,385 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 13:06:06,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-23 13:06:06,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 13:06:06,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:06,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:06,410 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 13:06:06,410 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:06:06,410 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 13:06:06,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-23 13:06:06,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 13:06:06,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:06,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:06,412 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 13:06:06,412 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:06:06,416 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 8#L559-2true [2018-11-23 13:06:06,417 INFO L796 eck$LassoCheckResult]: Loop: 8#L559-2true call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 13#L550-1true assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 6#L550-3true assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 9#L551true assume main_#t~mem7 > 0;havoc main_#t~mem7; 7#L552true assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 8#L559-2true [2018-11-23 13:06:06,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:06,420 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 13:06:06,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:06,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:06,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:06,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:06,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:06,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:06,499 INFO L82 PathProgramCache]: Analyzing trace with hash 35409681, now seen corresponding path program 1 times [2018-11-23 13:06:06,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:06,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:06,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:06,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:06,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:06,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:06,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849167, now seen corresponding path program 1 times [2018-11-23 13:06:06,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:06,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:06,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:06,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:06,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:06,710 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2018-11-23 13:06:06,831 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:06:06,832 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:06:06,832 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:06:06,833 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:06:06,833 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:06:06,833 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:06:06,833 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:06:06,833 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:06:06,833 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-23 13:06:06,833 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:06:06,834 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:06:06,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:06,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:06,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:06,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:06,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:06,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:06,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:07,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:07,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:07,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:07,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:07,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:07,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:07,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:07,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:07,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:07,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:07,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:07,295 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:06:07,299 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:06:07,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:07,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:07,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:07,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:07,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:07,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:07,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:07,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:07,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:07,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:07,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:07,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:07,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:07,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:07,311 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:07,311 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:07,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:07,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:07,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:07,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:07,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:07,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:07,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:07,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:07,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:07,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:07,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:07,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:07,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:07,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:07,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:07,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:07,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:07,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:07,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:07,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:07,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:07,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:07,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:07,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:07,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:07,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:07,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:07,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:07,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:07,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:07,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:07,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:07,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:07,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:07,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:07,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:07,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:07,335 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:06:07,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:07,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:07,338 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:06:07,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:07,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:07,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:07,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:07,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:07,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:07,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:07,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:07,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:07,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:07,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:07,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:07,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:07,354 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:06:07,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:07,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:07,356 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:06:07,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:07,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:07,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:07,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:07,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:07,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:07,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:07,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:07,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:07,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:07,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:07,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:07,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:07,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:07,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:07,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:07,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:07,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:07,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:07,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:07,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:07,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:07,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:07,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:07,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:07,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:07,407 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:06:07,411 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:06:07,411 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 13:06:07,413 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:06:07,413 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:06:07,413 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:06:07,414 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-11-23 13:06:07,449 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-23 13:06:07,454 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:06:07,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:07,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:07,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:07,532 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 13:06:07,534 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2018-11-23 13:06:07,635 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 5 states. Result 54 states and 72 transitions. Complement of second has 12 states. [2018-11-23 13:06:07,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 13:06:07,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:06:07,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2018-11-23 13:06:07,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-23 13:06:07,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:07,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-23 13:06:07,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:07,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-23 13:06:07,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:07,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 72 transitions. [2018-11-23 13:06:07,643 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-23 13:06:07,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 28 states and 43 transitions. [2018-11-23 13:06:07,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-23 13:06:07,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-23 13:06:07,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 43 transitions. [2018-11-23 13:06:07,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:06:07,647 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 43 transitions. [2018-11-23 13:06:07,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 43 transitions. [2018-11-23 13:06:07,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 20. [2018-11-23 13:06:07,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:06:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2018-11-23 13:06:07,665 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2018-11-23 13:06:07,665 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2018-11-23 13:06:07,665 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 13:06:07,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 30 transitions. [2018-11-23 13:06:07,666 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-23 13:06:07,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:07,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:07,666 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 13:06:07,666 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:06:07,666 INFO L794 eck$LassoCheckResult]: Stem: 178#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 172#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 173#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 184#L550-1 [2018-11-23 13:06:07,666 INFO L796 eck$LassoCheckResult]: Loop: 184#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 174#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 175#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 179#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 180#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 184#L550-1 [2018-11-23 13:06:07,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:07,667 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-23 13:06:07,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:07,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:07,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:07,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:07,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:07,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:07,680 INFO L82 PathProgramCache]: Analyzing trace with hash 38421593, now seen corresponding path program 1 times [2018-11-23 13:06:07,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:07,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:07,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:07,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:07,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:07,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:07,694 INFO L82 PathProgramCache]: Analyzing trace with hash 177749398, now seen corresponding path program 1 times [2018-11-23 13:06:07,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:07,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:07,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:07,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:07,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:07,830 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-23 13:06:07,936 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-11-23 13:06:08,088 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:06:08,089 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:06:08,089 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:06:08,089 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:06:08,089 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:06:08,089 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:06:08,089 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:06:08,089 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:06:08,089 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-23 13:06:08,089 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:06:08,089 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:06:08,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:08,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:08,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:08,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:08,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:08,336 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2018-11-23 13:06:08,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-11-23 13:06:08,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-11-23 13:06:08,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-11-23 13:06:08,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:08,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-11-23 13:06:08,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-11-23 13:06:08,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-11-23 13:06:08,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-11-23 13:06:08,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:08,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:08,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:08,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:08,631 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:06:08,632 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:06:08,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:08,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:08,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:08,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:08,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:08,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:08,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:08,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:08,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:08,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:08,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:08,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:08,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:08,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:08,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:08,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:08,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:08,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:08,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:08,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:08,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:08,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:08,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:08,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:08,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:08,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:08,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:08,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:08,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:08,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:08,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:08,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:08,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:08,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:08,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:08,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:08,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:08,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:08,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:08,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:08,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:08,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:08,645 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:06:08,646 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:06:08,647 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 13:06:08,647 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:06:08,647 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:06:08,647 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:06:08,647 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 Supporting invariants [] [2018-11-23 13:06:08,678 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-23 13:06:08,679 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:06:08,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:08,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:08,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:08,736 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:08,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 33 [2018-11-23 13:06:08,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:08,744 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-11-23 13:06:08,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:08,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:08,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:08,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-11-23 13:06:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:08,762 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-23 13:06:08,762 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-23 13:06:08,797 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 43 states and 66 transitions. Complement of second has 9 states. [2018-11-23 13:06:08,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 13:06:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:06:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-23 13:06:08,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 3 letters. Loop has 5 letters. [2018-11-23 13:06:08,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:08,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-23 13:06:08,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:08,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 3 letters. Loop has 10 letters. [2018-11-23 13:06:08,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:08,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 66 transitions. [2018-11-23 13:06:08,803 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-23 13:06:08,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 64 transitions. [2018-11-23 13:06:08,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-23 13:06:08,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 13:06:08,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 64 transitions. [2018-11-23 13:06:08,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:06:08,804 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 64 transitions. [2018-11-23 13:06:08,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 64 transitions. [2018-11-23 13:06:08,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-23 13:06:08,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:06:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 61 transitions. [2018-11-23 13:06:08,808 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 61 transitions. [2018-11-23 13:06:08,808 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 61 transitions. [2018-11-23 13:06:08,808 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 13:06:08,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 61 transitions. [2018-11-23 13:06:08,809 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-23 13:06:08,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:08,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:08,809 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 13:06:08,809 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:06:08,810 INFO L794 eck$LassoCheckResult]: Stem: 338#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 332#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 333#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 357#L550-1 assume !main_#t~short6; 353#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 347#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 348#L559 [2018-11-23 13:06:08,810 INFO L796 eck$LassoCheckResult]: Loop: 348#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 343#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 344#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 350#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 351#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 348#L559 [2018-11-23 13:06:08,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:08,810 INFO L82 PathProgramCache]: Analyzing trace with hash 889571379, now seen corresponding path program 1 times [2018-11-23 13:06:08,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:08,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:08,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:08,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:08,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:08,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:06:08,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:06:08,837 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:06:08,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:08,838 INFO L82 PathProgramCache]: Analyzing trace with hash 58400557, now seen corresponding path program 1 times [2018-11-23 13:06:08,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:08,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:08,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:08,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:08,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:08,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:06:08,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:06:08,922 INFO L87 Difference]: Start difference. First operand 39 states and 61 transitions. cyclomatic complexity: 27 Second operand 3 states. [2018-11-23 13:06:08,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:08,929 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2018-11-23 13:06:08,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:06:08,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 61 transitions. [2018-11-23 13:06:08,930 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-23 13:06:08,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 39 states and 50 transitions. [2018-11-23 13:06:08,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-23 13:06:08,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-23 13:06:08,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2018-11-23 13:06:08,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:06:08,931 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-11-23 13:06:08,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2018-11-23 13:06:08,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 13:06:08,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:06:08,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-11-23 13:06:08,934 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-11-23 13:06:08,934 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-11-23 13:06:08,934 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 13:06:08,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2018-11-23 13:06:08,934 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-23 13:06:08,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:08,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:08,935 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 13:06:08,935 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:06:08,935 INFO L794 eck$LassoCheckResult]: Stem: 429#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 423#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 424#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 434#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 447#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 438#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 439#L559 [2018-11-23 13:06:08,935 INFO L796 eck$LassoCheckResult]: Loop: 439#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 445#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 450#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 425#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 426#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 439#L559 [2018-11-23 13:06:08,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:08,936 INFO L82 PathProgramCache]: Analyzing trace with hash 889569457, now seen corresponding path program 1 times [2018-11-23 13:06:08,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:08,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:08,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:08,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:08,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:08,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:08,947 INFO L82 PathProgramCache]: Analyzing trace with hash 58400557, now seen corresponding path program 2 times [2018-11-23 13:06:08,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:08,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:08,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:08,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:08,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:08,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:08,956 INFO L82 PathProgramCache]: Analyzing trace with hash -127775619, now seen corresponding path program 1 times [2018-11-23 13:06:08,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:08,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:08,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:08,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:08,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:09,149 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:06:09,149 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:06:09,149 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:06:09,150 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:06:09,150 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:06:09,150 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:06:09,150 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:06:09,150 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:06:09,150 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-23 13:06:09,150 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:06:09,150 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:06:09,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-11-23 13:06:09,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-11-23 13:06:09,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:09,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:09,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:09,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:09,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:09,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:09,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:09,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:09,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:09,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:09,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:09,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:09,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:09,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:09,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:09,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:09,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:09,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:09,471 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:06:09,471 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:06:09,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:09,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:09,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:09,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:09,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:09,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:09,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:09,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:09,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:09,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:09,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:09,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:09,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:09,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:09,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:09,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:09,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:09,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:09,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:09,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:09,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:09,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:09,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:09,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:09,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:09,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:09,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:09,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:09,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:09,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:09,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:09,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:09,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:09,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:09,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:09,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:09,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:09,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:09,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:09,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:09,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:09,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:09,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:09,490 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:06:09,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:09,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:09,491 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:06:09,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:09,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:09,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:09,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:09,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:09,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:09,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:09,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:09,497 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:09,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:09,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:09,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:09,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:09,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:09,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:09,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:09,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:09,513 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:06:09,519 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 13:06:09,519 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 13:06:09,520 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:06:09,523 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:06:09,523 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:06:09,523 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2018-11-23 13:06:09,550 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-23 13:06:09,552 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:06:09,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:09,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:09,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:09,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:09,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 30 [2018-11-23 13:06:09,581 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:09,582 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 30 treesize of output 21 [2018-11-23 13:06:09,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:09,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:09,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:09,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2018-11-23 13:06:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:09,599 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 13:06:09,599 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-11-23 13:06:09,661 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 65 states and 85 transitions. Complement of second has 9 states. [2018-11-23 13:06:09,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 13:06:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:06:09,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-23 13:06:09,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 6 letters. Loop has 5 letters. [2018-11-23 13:06:09,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:09,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-23 13:06:09,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:09,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 6 letters. Loop has 10 letters. [2018-11-23 13:06:09,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:09,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 85 transitions. [2018-11-23 13:06:09,664 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2018-11-23 13:06:09,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 84 transitions. [2018-11-23 13:06:09,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-23 13:06:09,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-23 13:06:09,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 84 transitions. [2018-11-23 13:06:09,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:06:09,665 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 84 transitions. [2018-11-23 13:06:09,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 84 transitions. [2018-11-23 13:06:09,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-11-23 13:06:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 13:06:09,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2018-11-23 13:06:09,670 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 80 transitions. [2018-11-23 13:06:09,670 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 80 transitions. [2018-11-23 13:06:09,670 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 13:06:09,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 80 transitions. [2018-11-23 13:06:09,673 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2018-11-23 13:06:09,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:09,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:09,673 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:09,673 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1] [2018-11-23 13:06:09,673 INFO L794 eck$LassoCheckResult]: Stem: 634#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 632#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 633#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 643#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 671#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 664#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 660#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 661#L559-2 [2018-11-23 13:06:09,673 INFO L796 eck$LassoCheckResult]: Loop: 661#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 672#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 635#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 636#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 647#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 676#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 648#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 649#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 666#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 667#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 661#L559-2 [2018-11-23 13:06:09,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:09,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849423, now seen corresponding path program 2 times [2018-11-23 13:06:09,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:09,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:09,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:09,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:09,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:09,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:09,687 INFO L82 PathProgramCache]: Analyzing trace with hash -552559553, now seen corresponding path program 1 times [2018-11-23 13:06:09,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:09,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:09,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:09,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:09,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:09,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:09,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:06:09,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:06:09,798 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:06:09,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:06:09,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:06:09,799 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-11-23 13:06:09,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:09,859 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2018-11-23 13:06:09,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:06:09,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 100 transitions. [2018-11-23 13:06:09,861 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-23 13:06:09,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 67 states and 83 transitions. [2018-11-23 13:06:09,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-23 13:06:09,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-23 13:06:09,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 83 transitions. [2018-11-23 13:06:09,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:06:09,862 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2018-11-23 13:06:09,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 83 transitions. [2018-11-23 13:06:09,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2018-11-23 13:06:09,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 13:06:09,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2018-11-23 13:06:09,865 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 59 transitions. [2018-11-23 13:06:09,865 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 59 transitions. [2018-11-23 13:06:09,865 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 13:06:09,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 59 transitions. [2018-11-23 13:06:09,865 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-11-23 13:06:09,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:09,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:09,866 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:09,866 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:06:09,866 INFO L794 eck$LassoCheckResult]: Stem: 795#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 789#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 790#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 824#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 823#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 816#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 814#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 800#L559-2 [2018-11-23 13:06:09,866 INFO L796 eck$LassoCheckResult]: Loop: 800#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 801#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 791#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 792#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 804#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 800#L559-2 [2018-11-23 13:06:09,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:09,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849423, now seen corresponding path program 3 times [2018-11-23 13:06:09,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:09,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:09,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:09,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:09,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:09,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:09,882 INFO L82 PathProgramCache]: Analyzing trace with hash 35409683, now seen corresponding path program 2 times [2018-11-23 13:06:09,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:09,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:09,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:09,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:09,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:09,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:09,891 INFO L82 PathProgramCache]: Analyzing trace with hash 333922885, now seen corresponding path program 1 times [2018-11-23 13:06:09,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:09,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:09,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:09,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:09,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:09,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:09,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:09,956 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c5429d0-1070-4362-b690-83d8f860282f/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-11-23 13:06:09,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:09,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:10,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:10,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 [2018-11-23 13:06:10,037 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:10,038 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 34 treesize of output 23 [2018-11-23 13:06:10,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:10,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:10,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:10,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:16 [2018-11-23 13:06:10,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 17 [2018-11-23 13:06:10,051 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-11-23 13:06:10,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:10,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:10,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:10,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:3 [2018-11-23 13:06:10,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:10,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:10,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-23 13:06:10,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:06:10,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:06:10,183 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. cyclomatic complexity: 18 Second operand 10 states. [2018-11-23 13:06:10,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:10,245 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2018-11-23 13:06:10,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:06:10,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 66 transitions. [2018-11-23 13:06:10,246 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-23 13:06:10,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 50 states and 61 transitions. [2018-11-23 13:06:10,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-23 13:06:10,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-23 13:06:10,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 61 transitions. [2018-11-23 13:06:10,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:06:10,247 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-11-23 13:06:10,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 61 transitions. [2018-11-23 13:06:10,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-23 13:06:10,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 13:06:10,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2018-11-23 13:06:10,249 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-11-23 13:06:10,249 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-11-23 13:06:10,249 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 13:06:10,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 61 transitions. [2018-11-23 13:06:10,250 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-23 13:06:10,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:10,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:10,250 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:10,250 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:06:10,250 INFO L794 eck$LassoCheckResult]: Stem: 947#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 941#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 942#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 959#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 960#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 956#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 957#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 964#L559-2 [2018-11-23 13:06:10,250 INFO L796 eck$LassoCheckResult]: Loop: 964#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 977#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 974#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 971#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 962#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 964#L559-2 [2018-11-23 13:06:10,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:10,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849425, now seen corresponding path program 1 times [2018-11-23 13:06:10,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:10,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:10,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:10,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:10,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:10,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:10,261 INFO L82 PathProgramCache]: Analyzing trace with hash 35409939, now seen corresponding path program 1 times [2018-11-23 13:06:10,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:10,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:10,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:10,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:10,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:10,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:10,268 INFO L82 PathProgramCache]: Analyzing trace with hash 391181443, now seen corresponding path program 2 times [2018-11-23 13:06:10,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:10,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:10,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:10,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:10,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:10,497 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2018-11-23 13:06:10,540 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:06:10,540 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:06:10,540 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:06:10,540 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:06:10,541 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:06:10,541 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:06:10,541 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:06:10,541 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:06:10,541 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-23 13:06:10,541 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:06:10,541 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:06:10,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:10,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:10,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:10,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:10,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:10,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:10,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:10,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:10,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:10,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:10,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:10,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:10,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:10,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:10,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:10,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:10,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:10,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:10,865 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:06:10,865 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:06:10,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-11-23 13:06:10,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:10,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:10,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:10,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:10,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:10,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-11-23 13:06:10,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:10,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:10,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:10,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:10,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:10,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:10,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:10,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:10,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:10,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:10,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:10,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:10,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:10,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:10,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:10,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:10,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:10,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:10,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:10,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:10,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:10,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:10,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-11-23 13:06:10,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:10,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:10,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:10,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:10,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:10,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:10,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:10,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:10,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:10,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:10,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:10,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:10,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:10,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:10,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:10,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:10,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-11-23 13:06:10,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:10,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:10,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:10,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:10,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:10,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:10,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:10,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:10,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:10,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:10,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:10,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:10,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:10,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:10,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:10,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:10,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:10,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:10,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:10,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:10,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:10,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:10,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:10,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:10,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:10,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:10,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:10,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:10,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:10,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:10,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:10,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:10,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:10,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-11-23 13:06:10,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:10,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:10,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:10,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:10,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:10,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:10,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:10,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:10,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:10,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:10,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:10,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:10,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:10,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:10,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:10,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:10,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-11-23 13:06:10,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:10,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:10,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:10,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:10,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:10,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:10,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:10,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:10,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:10,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:10,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,914 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:06:10,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,915 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:06:10,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:10,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:10,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:10,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,918 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:06:10,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,919 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:06:10,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:10,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:10,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:10,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:10,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:10,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:10,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:10,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:10,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:10,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:10,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:10,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:10,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:10,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:10,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:10,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:10,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:10,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:10,930 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:10,932 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:06:10,934 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:06:10,934 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 13:06:10,934 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:06:10,935 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:06:10,935 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:06:10,935 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4 Supporting invariants [] [2018-11-23 13:06:10,967 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-23 13:06:10,968 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:06:10,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:10,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:10,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:11,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:11,019 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-23 13:06:11,019 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 61 transitions. cyclomatic complexity: 16 Second operand 6 states. [2018-11-23 13:06:11,059 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 61 transitions. cyclomatic complexity: 16. Second operand 6 states. Result 78 states and 95 transitions. Complement of second has 11 states. [2018-11-23 13:06:11,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 13:06:11,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:06:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-23 13:06:11,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-23 13:06:11,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:11,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-23 13:06:11,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:11,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 7 letters. Loop has 10 letters. [2018-11-23 13:06:11,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:11,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 95 transitions. [2018-11-23 13:06:11,060 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2018-11-23 13:06:11,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 73 states and 89 transitions. [2018-11-23 13:06:11,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-23 13:06:11,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-23 13:06:11,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 89 transitions. [2018-11-23 13:06:11,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:06:11,061 INFO L705 BuchiCegarLoop]: Abstraction has 73 states and 89 transitions. [2018-11-23 13:06:11,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 89 transitions. [2018-11-23 13:06:11,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2018-11-23 13:06:11,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 13:06:11,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2018-11-23 13:06:11,063 INFO L728 BuchiCegarLoop]: Abstraction has 65 states and 80 transitions. [2018-11-23 13:06:11,063 INFO L608 BuchiCegarLoop]: Abstraction has 65 states and 80 transitions. [2018-11-23 13:06:11,063 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 13:06:11,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 80 transitions. [2018-11-23 13:06:11,064 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2018-11-23 13:06:11,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:11,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:11,064 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-11-23 13:06:11,065 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:06:11,065 INFO L794 eck$LassoCheckResult]: Stem: 1187#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1181#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1182#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1224#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1221#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1218#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 1216#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 1213#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1214#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1238#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1242#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 1207#L552 [2018-11-23 13:06:11,065 INFO L796 eck$LassoCheckResult]: Loop: 1207#L552 assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 1239#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1240#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1212#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1208#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 1207#L552 [2018-11-23 13:06:11,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:11,065 INFO L82 PathProgramCache]: Analyzing trace with hash -125928585, now seen corresponding path program 1 times [2018-11-23 13:06:11,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:11,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:11,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:11,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:11,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:11,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:11,080 INFO L82 PathProgramCache]: Analyzing trace with hash 51012381, now seen corresponding path program 2 times [2018-11-23 13:06:11,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:11,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:11,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:11,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:11,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:11,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:11,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1455202663, now seen corresponding path program 1 times [2018-11-23 13:06:11,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:11,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:11,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:11,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:11,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:11,363 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 86 [2018-11-23 13:06:11,397 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:06:11,397 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:06:11,397 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:06:11,397 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:06:11,397 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:06:11,397 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:06:11,398 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:06:11,398 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:06:11,398 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration8_Lasso [2018-11-23 13:06:11,398 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:06:11,398 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:06:11,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:11,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:11,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:11,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:11,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:11,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-11-23 13:06:11,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:11,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:11,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-11-23 13:06:11,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-11-23 13:06:11,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:11,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-11-23 13:06:11,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-11-23 13:06:11,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-11-23 13:06:11,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-11-23 13:06:11,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-11-23 13:06:11,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-11-23 13:06:11,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-11-23 13:06:11,698 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:06:11,698 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:06:11,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:11,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:11,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:11,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:11,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:11,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:11,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:11,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:11,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:11,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:11,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:11,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:11,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:11,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:11,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:11,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:11,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:11,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:11,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:11,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:11,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:11,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:11,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:11,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:11,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:11,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:11,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:11,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:11,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:11,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:11,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:11,704 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:11,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:11,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:11,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:11,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:11,706 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:06:11,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:11,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:11,708 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:06:11,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:11,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:11,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:11,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:11,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:11,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:11,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:11,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:11,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:11,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:11,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:11,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:11,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:11,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:11,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:11,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:11,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:11,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:11,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:11,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:11,722 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:06:11,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:11,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:11,723 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:06:11,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:11,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:11,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:11,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:11,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:11,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:11,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:11,728 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:11,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:11,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:11,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:11,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:11,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:11,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:11,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:11,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:11,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:11,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:11,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:11,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:11,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:11,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:11,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:11,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:11,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:11,747 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:06:11,750 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:06:11,750 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 13:06:11,750 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:06:11,751 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:06:11,751 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:06:11,751 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5 Supporting invariants [] [2018-11-23 13:06:11,785 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-23 13:06:11,787 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:06:11,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:11,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:11,825 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 5 treesize of output 1 [2018-11-23 13:06:11,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:11,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:11,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-11-23 13:06:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:11,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:11,845 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:11,846 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 47 treesize of output 39 [2018-11-23 13:06:11,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:11,853 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 28 treesize of output 19 [2018-11-23 13:06:11,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:11,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 21 treesize of output 22 [2018-11-23 13:06:11,867 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-11-23 13:06:11,867 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:11,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:11,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:11,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:11,878 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-11-23 13:06:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:11,894 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 13:06:11,894 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 80 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-11-23 13:06:11,960 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 80 transitions. cyclomatic complexity: 22. Second operand 5 states. Result 169 states and 208 transitions. Complement of second has 10 states. [2018-11-23 13:06:11,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 13:06:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:06:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2018-11-23 13:06:11,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-23 13:06:11,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:11,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-23 13:06:11,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:11,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 11 letters. Loop has 10 letters. [2018-11-23 13:06:11,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:11,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 208 transitions. [2018-11-23 13:06:11,963 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 34 [2018-11-23 13:06:11,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 149 states and 187 transitions. [2018-11-23 13:06:11,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2018-11-23 13:06:11,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2018-11-23 13:06:11,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 187 transitions. [2018-11-23 13:06:11,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:06:11,965 INFO L705 BuchiCegarLoop]: Abstraction has 149 states and 187 transitions. [2018-11-23 13:06:11,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 187 transitions. [2018-11-23 13:06:11,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 122. [2018-11-23 13:06:11,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 13:06:11,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 157 transitions. [2018-11-23 13:06:11,970 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 157 transitions. [2018-11-23 13:06:11,971 INFO L608 BuchiCegarLoop]: Abstraction has 122 states and 157 transitions. [2018-11-23 13:06:11,971 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 13:06:11,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 157 transitions. [2018-11-23 13:06:11,971 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2018-11-23 13:06:11,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:11,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:11,972 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:11,972 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:06:11,972 INFO L794 eck$LassoCheckResult]: Stem: 1548#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1542#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1543#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1601#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1604#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1605#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 1610#L552 assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 1611#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1554#L550-1 [2018-11-23 13:06:11,972 INFO L796 eck$LassoCheckResult]: Loop: 1554#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1544#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1545#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 1549#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 1550#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1554#L550-1 [2018-11-23 13:06:11,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:11,972 INFO L82 PathProgramCache]: Analyzing trace with hash 177749336, now seen corresponding path program 2 times [2018-11-23 13:06:11,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:11,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:11,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:11,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:11,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:11,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:11,990 INFO L82 PathProgramCache]: Analyzing trace with hash 38421593, now seen corresponding path program 3 times [2018-11-23 13:06:11,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:11,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:11,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:11,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:11,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:11,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:11,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2100968094, now seen corresponding path program 1 times [2018-11-23 13:06:11,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:11,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:12,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:12,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:12,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:12,289 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2018-11-23 13:06:12,499 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 71 [2018-11-23 13:06:12,501 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:06:12,501 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:06:12,501 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:06:12,501 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:06:12,501 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:06:12,501 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:06:12,501 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:06:12,501 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:06:12,501 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration9_Lasso [2018-11-23 13:06:12,501 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:06:12,501 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:06:12,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-11-23 13:06:12,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:12,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-11-23 13:06:12,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-11-23 13:06:12,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-11-23 13:06:12,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-11-23 13:06:12,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-11-23 13:06:12,704 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2018-11-23 13:06:12,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:12,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:12,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:12,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:12,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:12,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:12,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:12,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:12,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:12,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:12,996 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:06:12,996 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:06:12,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:12,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:12,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:12,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:12,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:12,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:12,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:12,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:12,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:12,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:12,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:12,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:12,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:12,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:12,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:12,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:12,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:12,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:12,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:12,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:12,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:12,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:12,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:13,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:13,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:13,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:13,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:13,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:13,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:13,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:13,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:13,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:13,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:13,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:13,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:13,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:13,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:13,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:13,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:13,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:13,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:13,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:13,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:13,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:13,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:13,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:13,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:13,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:13,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:13,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:13,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:13,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:13,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:13,010 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:06:13,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:13,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:13,011 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:06:13,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:13,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:13,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:13,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:13,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:13,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:13,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:13,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:13,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:13,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:13,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:13,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:13,018 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:06:13,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:13,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:13,019 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:06:13,019 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:13,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:13,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:13,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:13,022 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:06:13,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:13,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:13,023 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:06:13,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:13,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:13,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:13,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:13,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:13,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:13,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:13,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:13,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:13,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:13,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:13,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:13,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:13,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:13,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:13,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:13,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:13,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:13,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:13,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:13,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:13,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:13,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:13,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:13,039 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:13,041 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:06:13,043 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:06:13,043 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 13:06:13,043 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:06:13,043 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:06:13,044 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:06:13,044 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6 Supporting invariants [] [2018-11-23 13:06:13,092 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-23 13:06:13,093 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:06:13,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:13,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:13,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:13,131 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:13,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 33 [2018-11-23 13:06:13,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:13,134 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-11-23 13:06:13,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:13,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:13,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:13,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-11-23 13:06:13,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:13,147 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-23 13:06:13,147 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48 Second operand 5 states. [2018-11-23 13:06:13,169 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48. Second operand 5 states. Result 147 states and 182 transitions. Complement of second has 9 states. [2018-11-23 13:06:13,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 13:06:13,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:06:13,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-11-23 13:06:13,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-23 13:06:13,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:13,174 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:06:13,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:13,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:13,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:13,214 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:13,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 33 [2018-11-23 13:06:13,216 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:13,217 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-11-23 13:06:13,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:13,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:13,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:13,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-11-23 13:06:13,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:13,229 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-23 13:06:13,229 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48 Second operand 5 states. [2018-11-23 13:06:13,261 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48. Second operand 5 states. Result 145 states and 182 transitions. Complement of second has 9 states. [2018-11-23 13:06:13,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 13:06:13,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:06:13,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2018-11-23 13:06:13,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-23 13:06:13,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:13,262 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:06:13,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:13,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:13,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:13,299 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:13,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 33 [2018-11-23 13:06:13,302 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:13,302 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-11-23 13:06:13,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:13,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:13,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:13,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-11-23 13:06:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:13,314 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-23 13:06:13,314 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48 Second operand 5 states. [2018-11-23 13:06:13,334 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48. Second operand 5 states. Result 214 states and 257 transitions. Complement of second has 8 states. [2018-11-23 13:06:13,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 13:06:13,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:06:13,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 13:06:13,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-23 13:06:13,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:13,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 13 letters. Loop has 5 letters. [2018-11-23 13:06:13,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:13,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 10 letters. [2018-11-23 13:06:13,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:13,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 257 transitions. [2018-11-23 13:06:13,337 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-23 13:06:13,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 157 states and 195 transitions. [2018-11-23 13:06:13,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-23 13:06:13,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-11-23 13:06:13,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 195 transitions. [2018-11-23 13:06:13,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:06:13,339 INFO L705 BuchiCegarLoop]: Abstraction has 157 states and 195 transitions. [2018-11-23 13:06:13,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 195 transitions. [2018-11-23 13:06:13,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 122. [2018-11-23 13:06:13,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 13:06:13,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 154 transitions. [2018-11-23 13:06:13,343 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 154 transitions. [2018-11-23 13:06:13,343 INFO L608 BuchiCegarLoop]: Abstraction has 122 states and 154 transitions. [2018-11-23 13:06:13,343 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 13:06:13,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 154 transitions. [2018-11-23 13:06:13,343 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-23 13:06:13,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:13,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:13,344 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1] [2018-11-23 13:06:13,344 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:06:13,344 INFO L794 eck$LassoCheckResult]: Stem: 2393#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2387#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 2388#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 2432#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 2433#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2476#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 2427#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 2426#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 2466#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 2465#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2464#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 2408#L559 [2018-11-23 13:06:13,344 INFO L796 eck$LassoCheckResult]: Loop: 2408#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 2409#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 2500#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 2499#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2497#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 2408#L559 [2018-11-23 13:06:13,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:13,344 INFO L82 PathProgramCache]: Analyzing trace with hash -125928577, now seen corresponding path program 3 times [2018-11-23 13:06:13,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:13,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:13,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:13,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:13,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:13,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:13,355 INFO L82 PathProgramCache]: Analyzing trace with hash 58400557, now seen corresponding path program 3 times [2018-11-23 13:06:13,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:13,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:13,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:13,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:13,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:13,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:13,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1691624047, now seen corresponding path program 1 times [2018-11-23 13:06:13,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:13,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:13,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:13,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:13,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:13,602 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 92 [2018-11-23 13:06:13,641 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:06:13,641 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:06:13,641 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:06:13,641 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:06:13,641 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:06:13,641 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:06:13,641 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:06:13,641 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:06:13,641 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration10_Lasso [2018-11-23 13:06:13,641 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:06:13,641 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:06:13,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:13,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:13,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:13,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:13,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:13,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:13,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:13,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:13,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:13,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:13,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:13,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:13,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:13,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:13,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:13,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:13,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:13,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:13,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:13,938 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:06:13,939 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:06:13,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:13,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:13,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:13,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:13,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:13,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:13,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:13,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:13,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:13,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:13,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:13,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:13,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:13,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:13,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:13,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:13,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:13,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:13,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:13,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:13,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:13,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:13,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:13,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:13,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:13,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:13,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:13,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:13,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:13,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:13,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:13,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:13,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:13,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:13,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:13,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:13,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:13,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:13,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:13,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:13,946 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:13,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:13,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:13,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:13,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:13,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:13,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:13,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:13,949 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:13,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:13,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:13,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:13,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:13,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:13,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:13,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:13,952 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:13,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:13,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:13,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:13,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:13,955 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:06:13,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:13,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:13,956 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:06:13,956 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:13,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:13,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:13,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:13,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:13,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:13,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:13,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:13,960 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:13,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:13,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:13,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:13,966 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:06:13,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:13,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:13,967 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:06:13,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:13,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:13,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:13,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:13,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:13,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:13,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:13,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:13,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:13,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:13,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:13,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:13,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:13,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:13,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:13,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:13,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:13,977 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:06:13,979 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 13:06:13,979 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 13:06:13,980 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:06:13,980 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:06:13,980 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:06:13,980 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_7) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_7 Supporting invariants [] [2018-11-23 13:06:14,048 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-23 13:06:14,049 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:06:14,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:14,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:14,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:14,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:14,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 30 [2018-11-23 13:06:14,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:14,095 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 30 treesize of output 21 [2018-11-23 13:06:14,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:14,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:14,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:14,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2018-11-23 13:06:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:14,110 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 13:06:14,110 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42 Second operand 4 states. [2018-11-23 13:06:14,132 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42. Second operand 4 states. Result 130 states and 164 transitions. Complement of second has 7 states. [2018-11-23 13:06:14,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:06:14,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:06:14,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-23 13:06:14,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-23 13:06:14,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:14,133 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:06:14,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:14,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:14,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:14,156 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:14,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 30 [2018-11-23 13:06:14,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:14,159 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 30 treesize of output 21 [2018-11-23 13:06:14,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:14,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:14,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:14,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2018-11-23 13:06:14,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:14,174 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 13:06:14,174 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42 Second operand 4 states. [2018-11-23 13:06:14,193 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42. Second operand 4 states. Result 130 states and 164 transitions. Complement of second has 7 states. [2018-11-23 13:06:14,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:06:14,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:06:14,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-23 13:06:14,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-23 13:06:14,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:14,194 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:06:14,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:14,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:14,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:14,216 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:14,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 30 [2018-11-23 13:06:14,220 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:14,220 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 30 treesize of output 21 [2018-11-23 13:06:14,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:14,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:14,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:14,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2018-11-23 13:06:14,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:14,235 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 13:06:14,235 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42 Second operand 4 states. [2018-11-23 13:06:14,257 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42. Second operand 4 states. Result 159 states and 196 transitions. Complement of second has 6 states. [2018-11-23 13:06:14,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:06:14,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:06:14,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-23 13:06:14,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-23 13:06:14,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:14,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-23 13:06:14,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:14,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 10 letters. [2018-11-23 13:06:14,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:14,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 196 transitions. [2018-11-23 13:06:14,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-23 13:06:14,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 129 states and 160 transitions. [2018-11-23 13:06:14,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-23 13:06:14,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-23 13:06:14,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 160 transitions. [2018-11-23 13:06:14,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:06:14,261 INFO L705 BuchiCegarLoop]: Abstraction has 129 states and 160 transitions. [2018-11-23 13:06:14,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 160 transitions. [2018-11-23 13:06:14,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2018-11-23 13:06:14,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-23 13:06:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 135 transitions. [2018-11-23 13:06:14,264 INFO L728 BuchiCegarLoop]: Abstraction has 108 states and 135 transitions. [2018-11-23 13:06:14,264 INFO L608 BuchiCegarLoop]: Abstraction has 108 states and 135 transitions. [2018-11-23 13:06:14,264 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 13:06:14,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 135 transitions. [2018-11-23 13:06:14,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-23 13:06:14,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:14,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:14,265 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:14,265 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1] [2018-11-23 13:06:14,265 INFO L794 eck$LassoCheckResult]: Stem: 3166#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3160#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 3161#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3172#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3253#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3252#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 3250#L552 assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 3168#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3245#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3243#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3242#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 3179#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 3180#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3266#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3178#L550-3 [2018-11-23 13:06:14,266 INFO L796 eck$LassoCheckResult]: Loop: 3178#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3192#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 3183#L552 assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 3188#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3186#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3187#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3264#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 3169#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 3170#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3177#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3178#L550-3 [2018-11-23 13:06:14,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:14,266 INFO L82 PathProgramCache]: Analyzing trace with hash -705255448, now seen corresponding path program 2 times [2018-11-23 13:06:14,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:14,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:14,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:14,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:14,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:14,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:14,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c5429d0-1070-4362-b690-83d8f860282f/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-11-23 13:06:14,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:06:14,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:06:14,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:14,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:14,355 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 5 treesize of output 1 [2018-11-23 13:06:14,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:14,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:14,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-23 13:06:14,373 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:14,374 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 47 treesize of output 39 [2018-11-23 13:06:14,376 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:06:14,376 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 28 treesize of output 19 [2018-11-23 13:06:14,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:14,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 21 treesize of output 22 [2018-11-23 13:06:14,384 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-11-23 13:06:14,384 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:14,388 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:14,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:14,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:14,394 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:9 [2018-11-23 13:06:14,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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-11-23 13:06:14,414 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 11 treesize of output 7 [2018-11-23 13:06:14,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:14,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:14,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:14,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-23 13:06:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:14,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:14,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-11-23 13:06:14,435 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:06:14,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:14,435 INFO L82 PathProgramCache]: Analyzing trace with hash 757834051, now seen corresponding path program 1 times [2018-11-23 13:06:14,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:14,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:14,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:14,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:14,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:14,593 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2018-11-23 13:06:14,725 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2018-11-23 13:06:14,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:06:14,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:06:14,725 INFO L87 Difference]: Start difference. First operand 108 states and 135 transitions. cyclomatic complexity: 34 Second operand 11 states. [2018-11-23 13:06:14,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:14,826 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2018-11-23 13:06:14,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:06:14,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 103 transitions. [2018-11-23 13:06:14,827 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:06:14,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 0 states and 0 transitions. [2018-11-23 13:06:14,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 13:06:14,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 13:06:14,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 13:06:14,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:06:14,828 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:06:14,828 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:06:14,828 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:06:14,828 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 13:06:14,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:06:14,828 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:06:14,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 13:06:14,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:06:14 BoogieIcfgContainer [2018-11-23 13:06:14,833 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 13:06:14,834 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:06:14,834 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:06:14,834 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:06:14,834 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:06" (3/4) ... [2018-11-23 13:06:14,837 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:06:14,837 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:06:14,838 INFO L168 Benchmark]: Toolchain (without parser) took 9032.34 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 326.6 MB). Free memory was 956.6 MB in the beginning and 1.0 GB in the end (delta: -91.7 MB). Peak memory consumption was 234.9 MB. Max. memory is 11.5 GB. [2018-11-23 13:06:14,838 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:06:14,839 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -174.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:06:14,839 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:06:14,839 INFO L168 Benchmark]: Boogie Preprocessor took 15.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:06:14,840 INFO L168 Benchmark]: RCFGBuilder took 170.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:06:14,840 INFO L168 Benchmark]: BuchiAutomizer took 8490.09 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.3 MB). Peak memory consumption was 246.9 MB. Max. memory is 11.5 GB. [2018-11-23 13:06:14,840 INFO L168 Benchmark]: Witness Printer took 3.45 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:06:14,842 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 322.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -174.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 170.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8490.09 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.3 MB). Peak memory consumption was 246.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.45 ms. Allocated memory is still 1.4 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 - 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 11 terminating modules (4 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 5 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 5 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.4s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 6.9s. Construction of modules took 0.3s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 125 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 122 states and ocurred in iteration 8. Nontrivial modules had stage [5, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 118 SDtfs, 152 SDslu, 64 SDs, 0 SdLazy, 501 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital254 mio100 ax107 hnf100 lsp81 ukn66 mio100 lsp36 div100 bol100 ite100 ukn100 eq183 hnf88 smp97 dnf103 smp97 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...