./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C_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_20184d44-1688-4c48-9ebe-2c56877cf5c5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_20184d44-1688-4c48-9ebe-2c56877cf5c5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_20184d44-1688-4c48-9ebe-2c56877cf5c5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_20184d44-1688-4c48-9ebe-2c56877cf5c5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_20184d44-1688-4c48-9ebe-2c56877cf5c5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_20184d44-1688-4c48-9ebe-2c56877cf5c5/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 faaae9aa069653e753b732f00a89bd7a139fa132 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 14:08:55,142 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:08:55,143 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:08:55,151 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:08:55,151 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:08:55,152 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:08:55,152 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:08:55,153 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:08:55,154 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:08:55,155 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:08:55,156 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:08:55,156 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:08:55,157 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:08:55,158 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:08:55,159 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:08:55,159 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:08:55,160 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:08:55,161 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:08:55,163 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:08:55,164 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:08:55,165 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:08:55,166 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:08:55,167 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:08:55,168 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:08:55,168 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:08:55,168 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:08:55,169 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:08:55,170 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:08:55,170 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:08:55,171 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:08:55,171 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:08:55,172 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:08:55,172 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:08:55,172 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:08:55,173 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:08:55,173 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:08:55,173 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_20184d44-1688-4c48-9ebe-2c56877cf5c5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 14:08:55,184 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:08:55,185 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:08:55,185 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:08:55,186 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:08:55,186 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:08:55,186 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 14:08:55,186 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 14:08:55,186 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 14:08:55,186 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 14:08:55,187 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 14:08:55,187 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 14:08:55,187 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:08:55,187 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 14:08:55,187 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:08:55,187 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:08:55,187 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 14:08:55,187 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 14:08:55,187 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 14:08:55,188 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:08:55,188 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 14:08:55,188 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:08:55,188 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 14:08:55,188 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:08:55,188 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:08:55,188 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 14:08:55,188 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:08:55,189 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 14:08:55,189 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 14:08:55,189 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 14:08:55,189 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_20184d44-1688-4c48-9ebe-2c56877cf5c5/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 -> faaae9aa069653e753b732f00a89bd7a139fa132 [2018-11-23 14:08:55,210 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:08:55,218 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:08:55,220 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:08:55,221 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:08:55,221 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:08:55,221 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_20184d44-1688-4c48-9ebe-2c56877cf5c5/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C_true-termination.c.i [2018-11-23 14:08:55,257 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_20184d44-1688-4c48-9ebe-2c56877cf5c5/bin-2019/uautomizer/data/f71402d42/012bac15de944cf4887495feec25a3b7/FLAGca3662812 [2018-11-23 14:08:55,654 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:08:55,654 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_20184d44-1688-4c48-9ebe-2c56877cf5c5/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C_true-termination.c.i [2018-11-23 14:08:55,658 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_20184d44-1688-4c48-9ebe-2c56877cf5c5/bin-2019/uautomizer/data/f71402d42/012bac15de944cf4887495feec25a3b7/FLAGca3662812 [2018-11-23 14:08:55,666 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_20184d44-1688-4c48-9ebe-2c56877cf5c5/bin-2019/uautomizer/data/f71402d42/012bac15de944cf4887495feec25a3b7 [2018-11-23 14:08:55,668 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:08:55,669 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:08:55,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:08:55,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:08:55,673 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:08:55,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:08:55" (1/1) ... [2018-11-23 14:08:55,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3605d9ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:55, skipping insertion in model container [2018-11-23 14:08:55,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:08:55" (1/1) ... [2018-11-23 14:08:55,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:08:55,697 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:08:55,798 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:08:55,804 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:08:55,815 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:08:55,824 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:08:55,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:55 WrapperNode [2018-11-23 14:08:55,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:08:55,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:08:55,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:08:55,825 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:08:55,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:55" (1/1) ... [2018-11-23 14:08:55,838 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:55" (1/1) ... [2018-11-23 14:08:55,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:08:55,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:08:55,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:08:55,851 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:08:55,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:55" (1/1) ... [2018-11-23 14:08:55,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:55" (1/1) ... [2018-11-23 14:08:55,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:55" (1/1) ... [2018-11-23 14:08:55,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:55" (1/1) ... [2018-11-23 14:08:55,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:55" (1/1) ... [2018-11-23 14:08:55,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:55" (1/1) ... [2018-11-23 14:08:55,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:55" (1/1) ... [2018-11-23 14:08:55,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:08:55,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:08:55,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:08:55,903 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:08:55,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20184d44-1688-4c48-9ebe-2c56877cf5c5/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 14:08:55,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 14:08:55,943 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-11-23 14:08:55,944 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-11-23 14:08:55,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:08:55,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:08:55,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:08:55,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:08:55,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:08:56,113 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:08:56,113 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 14:08:56,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:08:56 BoogieIcfgContainer [2018-11-23 14:08:56,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:08:56,114 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 14:08:56,114 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 14:08:56,117 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 14:08:56,118 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:08:56,118 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:08:55" (1/3) ... [2018-11-23 14:08:56,119 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@730df5cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:08:56, skipping insertion in model container [2018-11-23 14:08:56,119 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:08:56,119 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:55" (2/3) ... [2018-11-23 14:08:56,119 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@730df5cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:08:56, skipping insertion in model container [2018-11-23 14:08:56,119 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:08:56,120 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:08:56" (3/3) ... [2018-11-23 14:08:56,121 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11C_true-termination.c.i [2018-11-23 14:08:56,170 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:08:56,170 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 14:08:56,171 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 14:08:56,171 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 14:08:56,171 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:08:56,171 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:08:56,171 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 14:08:56,171 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:08:56,171 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 14:08:56,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 14:08:56,208 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 14:08:56,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:08:56,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:08:56,215 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 14:08:56,215 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:08:56,215 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 14:08:56,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 14:08:56,217 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 14:08:56,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:08:56,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:08:56,217 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 14:08:56,218 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:08:56,224 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 7#L31-3true [2018-11-23 14:08:56,225 INFO L796 eck$LassoCheckResult]: Loop: 7#L31-3true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 10#L31-1true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 18#L35true assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 8#L39true call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 3#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 12#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 17#recFINALtrue assume true; 15#recEXITtrue >#44#return; 6#L39-1true assume -1 == main_#t~ret12;main_#t~ite13 := -1; 20#L39-3true call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 7#L31-3true [2018-11-23 14:08:56,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:08:56,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2018-11-23 14:08:56,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:08:56,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:08:56,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:08:56,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:08:56,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:08:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:08:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:08:56,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:08:56,328 INFO L82 PathProgramCache]: Analyzing trace with hash -2107477180, now seen corresponding path program 1 times [2018-11-23 14:08:56,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:08:56,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:08:56,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:08:56,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:08:56,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:08:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:08:56,479 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 14:08:56,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:08:56,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 14:08:56,484 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 14:08:56,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 14:08:56,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 14:08:56,495 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2018-11-23 14:08:56,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:08:56,576 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-11-23 14:08:56,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 14:08:56,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-11-23 14:08:56,579 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 14:08:56,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 19 transitions. [2018-11-23 14:08:56,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 14:08:56,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-23 14:08:56,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-11-23 14:08:56,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:08:56,587 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-23 14:08:56,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-11-23 14:08:56,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 14:08:56,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 14:08:56,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-11-23 14:08:56,607 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-23 14:08:56,607 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-23 14:08:56,607 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 14:08:56,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-11-23 14:08:56,608 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 14:08:56,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:08:56,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:08:56,608 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 14:08:56,608 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:08:56,609 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 57#L31-3 [2018-11-23 14:08:56,609 INFO L796 eck$LassoCheckResult]: Loop: 57#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 58#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 61#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 52#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 51#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 54#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 53#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 51#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 54#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 63#recFINAL assume true; 65#recEXIT >#42#return; 59#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 60#recFINAL assume true; 66#recEXIT >#44#return; 55#L39-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 56#L39-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 57#L31-3 [2018-11-23 14:08:56,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:08:56,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2018-11-23 14:08:56,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:08:56,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:08:56,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:08:56,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:08:56,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:08:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:08:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:08:56,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:08:56,622 INFO L82 PathProgramCache]: Analyzing trace with hash 290320444, now seen corresponding path program 1 times [2018-11-23 14:08:56,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:08:56,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:08:56,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:08:56,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:08:56,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:08:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:08:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:08:56,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:08:56,687 INFO L82 PathProgramCache]: Analyzing trace with hash -645910274, now seen corresponding path program 1 times [2018-11-23 14:08:56,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:08:56,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:08:56,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:08:56,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:08:56,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:08:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:08:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:08:57,023 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-11-23 14:08:57,466 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 119 [2018-11-23 14:08:57,632 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:08:57,633 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:08:57,633 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:08:57,633 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:08:57,634 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:08:57,634 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:08:57,634 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:08:57,634 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:08:57,634 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C_true-termination.c.i_Iteration2_Lasso [2018-11-23 14:08:57,634 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:08:57,634 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:08:57,649 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 14:08:57,652 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 14:08:57,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:08:57,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:08:57,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:08:57,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:08:57,667 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 14:08:57,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:08:57,669 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 14:08:57,826 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 14:08:57,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:08:58,007 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:08:58,011 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:08:58,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:58,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:58,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:08:58,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:58,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:58,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:58,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:08:58,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:08:58,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:58,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:58,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:58,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:58,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:58,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:58,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:08:58,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:08:58,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:58,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:58,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:58,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:08:58,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:58,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:58,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:58,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:08:58,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:08:58,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:58,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:58,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:58,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:08:58,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:58,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:58,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:58,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:08:58,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:08:58,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:58,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:58,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:58,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:58,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:58,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:58,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:08:58,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:08:58,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:58,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:58,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:58,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:08:58,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:58,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:58,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:58,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:08:58,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:08:58,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:58,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:58,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:58,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:58,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:58,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:58,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:08:58,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:08:58,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:58,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:58,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:58,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:08:58,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:58,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:58,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:58,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:08:58,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:08:58,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:58,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:58,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:58,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:58,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:58,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:58,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:08:58,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:08:58,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:58,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:58,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:58,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:58,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:58,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:58,063 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:08:58,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:08:58,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:58,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:58,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:58,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:08:58,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:58,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:58,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:58,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:08:58,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:08:58,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:58,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:58,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:58,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:58,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:58,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:58,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:08:58,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:08:58,082 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:08:58,088 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 14:08:58,088 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 14:08:58,090 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:08:58,091 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 14:08:58,091 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:08:58,092 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2018-11-23 14:08:58,122 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 14:08:58,126 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 14:08:58,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:08:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:08:58,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:08:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:08:58,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:08:58,206 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:08:58,207 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:08:58,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 14:08:58,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:08:58,227 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 26 treesize of output 27 [2018-11-23 14:08:58,229 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 14:08:58,229 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:08:58,234 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:08:58,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:08:58,238 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:36, output treesize:15 [2018-11-23 14:08:58,247 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 22 treesize of output 16 [2018-11-23 14:08:58,248 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 16 treesize of output 10 [2018-11-23 14:08:58,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:08:58,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:08:58,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:08:58,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2018-11-23 14:08:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 14:08:58,295 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-23 14:08:58,295 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-23 14:08:58,378 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 62 states and 73 transitions. Complement of second has 17 states. [2018-11-23 14:08:58,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-23 14:08:58,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 14:08:58,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-11-23 14:08:58,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 16 letters. [2018-11-23 14:08:58,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:08:58,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 16 letters. [2018-11-23 14:08:58,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:08:58,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 32 letters. [2018-11-23 14:08:58,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:08:58,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 73 transitions. [2018-11-23 14:08:58,385 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-23 14:08:58,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 67 transitions. [2018-11-23 14:08:58,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-23 14:08:58,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-23 14:08:58,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2018-11-23 14:08:58,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:08:58,387 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-11-23 14:08:58,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2018-11-23 14:08:58,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2018-11-23 14:08:58,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 14:08:58,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2018-11-23 14:08:58,392 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-11-23 14:08:58,392 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-11-23 14:08:58,392 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 14:08:58,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2018-11-23 14:08:58,393 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-23 14:08:58,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:08:58,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:08:58,393 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:08:58,393 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 14:08:58,393 INFO L794 eck$LassoCheckResult]: Stem: 267#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 265#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 266#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 254#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 288#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 255#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 256#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 287#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 240#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 238#recENTRY [2018-11-23 14:08:58,393 INFO L796 eck$LassoCheckResult]: Loop: 238#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 241#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 239#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 238#recENTRY [2018-11-23 14:08:58,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:08:58,394 INFO L82 PathProgramCache]: Analyzing trace with hash -498407605, now seen corresponding path program 1 times [2018-11-23 14:08:58,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:08:58,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:08:58,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:08:58,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:08:58,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:08:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:08:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:08:58,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:08:58,414 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 1 times [2018-11-23 14:08:58,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:08:58,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:08:58,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:08:58,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:08:58,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:08:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:08:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:08:58,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:08:58,424 INFO L82 PathProgramCache]: Analyzing trace with hash -359018118, now seen corresponding path program 2 times [2018-11-23 14:08:58,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:08:58,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:08:58,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:08:58,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:08:58,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:08:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:08:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:08:58,889 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-11-23 14:08:59,138 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 102 [2018-11-23 14:08:59,187 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:08:59,187 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:08:59,187 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:08:59,188 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:08:59,188 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:08:59,188 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:08:59,188 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:08:59,188 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:08:59,188 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C_true-termination.c.i_Iteration3_Lasso [2018-11-23 14:08:59,188 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:08:59,188 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:08:59,191 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 14:08:59,194 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 14:08:59,195 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 14:08:59,196 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 14:08:59,197 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 14:08:59,198 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 14:08:59,199 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 14:08:59,200 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 14:08:59,201 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 14:08:59,202 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 14:08:59,203 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 14:08:59,205 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 14:08:59,206 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 14:08:59,207 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 14:08:59,208 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 14:08:59,209 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 14:08:59,210 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 14:08:59,212 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 14:08:59,213 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 14:08:59,323 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 14:08:59,324 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 14:08:59,325 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 14:08:59,326 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 14:08:59,327 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 14:08:59,329 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 14:08:59,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:08:59,331 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 14:08:59,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:08:59,333 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 14:08:59,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:08:59,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:08:59,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:08:59,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:08:59,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:08:59,341 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 14:08:59,534 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:08:59,534 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:08:59,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:59,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:59,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:08:59,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:59,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:59,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:59,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:08:59,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:08:59,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:59,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:59,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:59,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:08:59,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:59,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:59,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:59,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:08:59,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:08:59,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:59,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:59,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:59,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:08:59,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:59,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:59,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:59,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:08:59,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:08:59,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:59,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:59,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:59,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:08:59,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:59,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:59,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:59,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:08:59,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:08:59,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:59,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:59,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:59,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:08:59,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:59,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:59,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:59,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:08:59,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:08:59,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:59,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:59,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:59,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:08:59,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:59,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:59,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:59,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:08:59,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:08:59,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:59,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:59,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:59,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:08:59,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:59,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:59,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:59,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:08:59,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:08:59,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:59,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:59,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:59,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:08:59,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:59,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:59,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:59,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:08:59,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:08:59,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:59,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:59,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:59,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:08:59,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:59,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:59,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:59,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:08:59,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:08:59,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:59,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:59,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:59,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:08:59,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:59,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:59,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:59,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:08:59,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:08:59,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:59,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:59,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:59,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:59,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:59,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:59,555 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:08:59,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:08:59,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:59,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:59,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:59,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:08:59,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:59,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:59,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:59,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:08:59,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:08:59,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:59,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:08:59,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:59,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:08:59,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:59,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:59,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:59,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:08:59,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:08:59,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:59,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:08:59,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:59,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:08:59,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:59,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:59,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:59,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:08:59,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:08:59,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:59,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:59,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:59,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:08:59,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:59,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:59,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:59,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:08:59,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:08:59,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:59,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:59,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:59,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:08:59,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:59,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:59,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:59,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:08:59,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:08:59,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:59,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:59,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:59,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:08:59,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:59,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:59,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:59,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:08:59,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:08:59,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:59,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:59,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:59,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:08:59,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:59,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:59,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:59,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:08:59,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:08:59,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:59,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:59,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:59,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:59,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:59,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:59,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:08:59,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:08:59,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:59,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:08:59,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:59,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:59,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:59,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:59,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:08:59,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:08:59,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:59,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:59,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:59,586 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 14:08:59,586 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:08:59,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:59,588 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 14:08:59,588 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 14:08:59,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:08:59,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:08:59,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:08:59,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:08:59,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:08:59,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:08:59,599 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:08:59,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:08:59,611 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:08:59,616 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 14:08:59,616 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 14:08:59,616 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:08:59,617 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 14:08:59,617 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:08:59,617 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1 Supporting invariants [] [2018-11-23 14:08:59,633 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-23 14:08:59,643 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 14:08:59,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:08:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:08:59,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:08:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:08:59,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:08:59,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-23 14:08:59,743 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 37 treesize of output 36 [2018-11-23 14:08:59,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:08:59,768 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:08:59,776 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 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-23 14:08:59,778 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 14:08:59,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:08:59,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 14:08:59,809 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-23 14:08:59,837 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 14:08:59,837 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 14:08:59,837 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-11-23 14:08:59,912 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 99 states and 122 transitions. Complement of second has 17 states. [2018-11-23 14:08:59,913 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 14:08:59,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 14:08:59,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-23 14:08:59,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-23 14:08:59,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:08:59,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-23 14:08:59,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:08:59,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-23 14:08:59,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:08:59,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. [2018-11-23 14:08:59,921 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-23 14:08:59,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 87 states and 110 transitions. [2018-11-23 14:08:59,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-11-23 14:08:59,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-23 14:08:59,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2018-11-23 14:08:59,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:08:59,923 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2018-11-23 14:08:59,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2018-11-23 14:08:59,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-11-23 14:08:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 14:08:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2018-11-23 14:08:59,928 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-11-23 14:08:59,928 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-11-23 14:08:59,929 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 14:08:59,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 102 transitions. [2018-11-23 14:08:59,930 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-23 14:08:59,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:08:59,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:08:59,930 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:08:59,930 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:08:59,931 INFO L794 eck$LassoCheckResult]: Stem: 504#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 503#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 481#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 483#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 500#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 512#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 520#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 547#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 471#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 470#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 473#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 502#recFINAL assume true; 510#recEXIT >#42#return; 523#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 521#recFINAL assume true; 518#recEXIT >#44#return; 477#L39-1 assume !(-1 == main_#t~ret12);main_#t~ite13 := 1; 478#L39-3 [2018-11-23 14:08:59,931 INFO L796 eck$LassoCheckResult]: Loop: 478#L39-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 513#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 524#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 522#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 498#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 499#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 533#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 528#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 499#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 533#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 534#recFINAL assume true; 541#recEXIT >#42#return; 529#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 530#recFINAL assume true; 527#recEXIT >#44#return; 517#L39-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 478#L39-3 [2018-11-23 14:08:59,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:08:59,931 INFO L82 PathProgramCache]: Analyzing trace with hash -713572475, now seen corresponding path program 1 times [2018-11-23 14:08:59,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:08:59,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:08:59,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:08:59,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:08:59,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:08:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:09:00,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:09:00,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:09:00,033 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20184d44-1688-4c48-9ebe-2c56877cf5c5/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 14:09:00,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:09:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:09:00,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:09:00,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-11-23 14:09:00,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-23 14:09:00,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:09:00,131 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:09:00,140 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 2 case distinctions, treesize of input 21 treesize of output 33 [2018-11-23 14:09:00,141 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 14:09:00,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:09:00,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 14:09:00,171 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:25, output treesize:31 [2018-11-23 14:09:00,221 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 14:09:00,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:09:00,227 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 17 treesize of output 13 [2018-11-23 14:09:00,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 14:09:00,229 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:09:00,231 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:09:00,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:09:00,232 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:51, output treesize:5 [2018-11-23 14:09:00,250 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 14:09:00,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:09:00,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-11-23 14:09:00,266 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 14:09:00,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:09:00,266 INFO L82 PathProgramCache]: Analyzing trace with hash 542882406, now seen corresponding path program 2 times [2018-11-23 14:09:00,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:09:00,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:09:00,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:09:00,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:09:00,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:09:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:09:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:09:00,520 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-11-23 14:09:00,836 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 118 [2018-11-23 14:09:00,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 14:09:00,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-23 14:09:00,889 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. cyclomatic complexity: 26 Second operand 13 states. [2018-11-23 14:09:00,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:09:00,958 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2018-11-23 14:09:00,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 14:09:00,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 110 transitions. [2018-11-23 14:09:00,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 14:09:00,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 54 states and 67 transitions. [2018-11-23 14:09:00,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 14:09:00,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-23 14:09:00,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 67 transitions. [2018-11-23 14:09:00,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:09:00,961 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. [2018-11-23 14:09:00,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 67 transitions. [2018-11-23 14:09:00,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-11-23 14:09:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 14:09:00,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-11-23 14:09:00,965 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-23 14:09:00,965 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-23 14:09:00,965 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 14:09:00,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2018-11-23 14:09:00,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 14:09:00,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:09:00,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:09:00,966 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:09:00,966 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 14:09:00,966 INFO L794 eck$LassoCheckResult]: Stem: 732#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 731#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 716#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 717#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 749#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 725#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 726#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 740#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 722#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 745#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 729#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 730#recFINAL assume true; 750#recEXIT >#42#return; 738#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 737#recFINAL assume true; 736#recEXIT >#44#return; 714#L39-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 715#L39-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 718#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 720#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 727#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 709#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 706#recENTRY [2018-11-23 14:09:00,967 INFO L796 eck$LassoCheckResult]: Loop: 706#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 708#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 707#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 706#recENTRY [2018-11-23 14:09:00,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:09:00,967 INFO L82 PathProgramCache]: Analyzing trace with hash -873815595, now seen corresponding path program 2 times [2018-11-23 14:09:00,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:09:00,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:09:00,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:09:00,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:09:00,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:09:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:09:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:09:00,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:09:00,993 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 2 times [2018-11-23 14:09:00,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:09:00,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:09:00,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:09:00,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:09:00,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:09:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:09:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:09:01,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:09:01,000 INFO L82 PathProgramCache]: Analyzing trace with hash -43609424, now seen corresponding path program 3 times [2018-11-23 14:09:01,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:09:01,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:09:01,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:09:01,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:09:01,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:09:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:09:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:09:01,448 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-11-23 14:09:02,472 WARN L180 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 194 [2018-11-23 14:09:02,679 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-11-23 14:09:02,961 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2018-11-23 14:09:03,112 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-11-23 14:09:03,114 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:09:03,114 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:09:03,114 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:09:03,114 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:09:03,114 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:09:03,114 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:09:03,114 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:09:03,114 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:09:03,114 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C_true-termination.c.i_Iteration5_Lasso [2018-11-23 14:09:03,114 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:09:03,114 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:09:03,116 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 14:09:03,117 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 14:09:03,118 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 14:09:03,121 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 14:09:03,122 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 14:09:03,123 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 14:09:03,125 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 14:09:03,126 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 14:09:03,127 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 14:09:03,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:09:03,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:09:03,132 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 14:09:03,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:09:03,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:09:03,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:09:03,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:09:03,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:09:03,143 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 14:09:03,246 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 14:09:03,247 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 14:09:03,248 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 14:09:03,249 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 14:09:03,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 14:09:03,251 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 14:09:03,251 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 14:09:03,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 14:09:03,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 14:09:03,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 14:09:03,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 14:09:03,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 14:09:03,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 14:09:03,257 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 14:09:03,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 14:09:03,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 14:09:03,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 14:09:03,420 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:09:03,420 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:09:03,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:09:03,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:09:03,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:09:03,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:09:03,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:09:03,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:09:03,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:09:03,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:09:03,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:09:03,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:09:03,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:09:03,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:09:03,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:09:03,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:09:03,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:09:03,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:09:03,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:09:03,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:09:03,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:09:03,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:09:03,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:09:03,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:09:03,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:09:03,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:09:03,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:09:03,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:09:03,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:09:03,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:09:03,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:09:03,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:09:03,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:09:03,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:09:03,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:09:03,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:09:03,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:09:03,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:09:03,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:09:03,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:09:03,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:09:03,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:09:03,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:09:03,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:09:03,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:09:03,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:09:03,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:09:03,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:09:03,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:09:03,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:09:03,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:09:03,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:09:03,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:09:03,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:09:03,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:09:03,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:09:03,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:09:03,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:09:03,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:09:03,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:09:03,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:09:03,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:09:03,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:09:03,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:09:03,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:09:03,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:09:03,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:09:03,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:09:03,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:09:03,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:09:03,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:09:03,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:09:03,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:09:03,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:09:03,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:09:03,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:09:03,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:09:03,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:09:03,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:09:03,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:09:03,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:09:03,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:09:03,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:09:03,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:09:03,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:09:03,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:09:03,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:09:03,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:09:03,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:09:03,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:09:03,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:09:03,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:09:03,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:09:03,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:09:03,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:09:03,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:09:03,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:09:03,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:09:03,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:09:03,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:09:03,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:09:03,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:09:03,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:09:03,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:09:03,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:09:03,441 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:09:03,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:09:03,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:09:03,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:09:03,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:09:03,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:09:03,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:09:03,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:09:03,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:09:03,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:09:03,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:09:03,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:09:03,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:09:03,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:09:03,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:09:03,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:09:03,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:09:03,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:09:03,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:09:03,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:09:03,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:09:03,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:09:03,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:09:03,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:09:03,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:09:03,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:09:03,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:09:03,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:09:03,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:09:03,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:09:03,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:09:03,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:09:03,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:09:03,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:09:03,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:09:03,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:09:03,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:09:03,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:09:03,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:09:03,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:09:03,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:09:03,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:09:03,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:09:03,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:09:03,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:09:03,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:09:03,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:09:03,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:09:03,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:09:03,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:09:03,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:09:03,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:09:03,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:09:03,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:09:03,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:09:03,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:09:03,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:09:03,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:09:03,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:09:03,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:09:03,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:09:03,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:09:03,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:09:03,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:09:03,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:09:03,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:09:03,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:09:03,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:09:03,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:09:03,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:09:03,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:09:03,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:09:03,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 14:09:03,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:09:03,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:09:03,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:09:03,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:09:03,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:09:03,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:09:03,484 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:09:03,487 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 14:09:03,487 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 14:09:03,487 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:09:03,488 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 14:09:03,488 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:09:03,488 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2 + 1 Supporting invariants [] [2018-11-23 14:09:03,502 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 14:09:03,503 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 14:09:03,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:09:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:09:03,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:09:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:09:03,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:09:03,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-23 14:09:03,582 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 37 treesize of output 36 [2018-11-23 14:09:03,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:09:03,608 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:09:03,613 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 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-23 14:09:03,614 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 14:09:03,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:09:03,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 14:09:03,637 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-23 14:09:03,654 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 14:09:03,654 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 14:09:03,654 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-23 14:09:03,701 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2018-11-23 14:09:03,702 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 14:09:03,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 14:09:03,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-23 14:09:03,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-23 14:09:03,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:09:03,702 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 14:09:03,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:09:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:09:03,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:09:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:09:03,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:09:03,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-23 14:09:03,782 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 37 treesize of output 36 [2018-11-23 14:09:03,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:09:03,799 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:09:03,803 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 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-23 14:09:03,804 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 14:09:03,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:09:03,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 14:09:03,824 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-23 14:09:03,837 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 14:09:03,837 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 14:09:03,837 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-23 14:09:03,870 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2018-11-23 14:09:03,871 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 14:09:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 14:09:03,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-23 14:09:03,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-23 14:09:03,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:09:03,872 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 14:09:03,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:09:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:09:03,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:09:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:09:03,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:09:03,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-23 14:09:03,943 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 37 treesize of output 36 [2018-11-23 14:09:03,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:09:03,961 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:09:03,966 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 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-23 14:09:03,966 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 14:09:03,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:09:03,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 14:09:03,987 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-23 14:09:04,001 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 14:09:04,001 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 14:09:04,001 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-23 14:09:04,051 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 68 states and 78 transitions. Complement of second has 15 states. [2018-11-23 14:09:04,051 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 14:09:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 14:09:04,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-23 14:09:04,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-23 14:09:04,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:09:04,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2018-11-23 14:09:04,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:09:04,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-23 14:09:04,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:09:04,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2018-11-23 14:09:04,055 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 14:09:04,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2018-11-23 14:09:04,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 14:09:04,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 14:09:04,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 14:09:04,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:09:04,056 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:09:04,056 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:09:04,056 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:09:04,056 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 14:09:04,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 14:09:04,056 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 14:09:04,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 14:09:04,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:09:04 BoogieIcfgContainer [2018-11-23 14:09:04,061 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 14:09:04,062 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:09:04,062 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:09:04,062 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:09:04,062 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:08:56" (3/4) ... [2018-11-23 14:09:04,065 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 14:09:04,065 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:09:04,065 INFO L168 Benchmark]: Toolchain (without parser) took 8396.70 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 376.4 MB). Free memory was 959.3 MB in the beginning and 1.3 GB in the end (delta: -302.4 MB). Peak memory consumption was 74.0 MB. Max. memory is 11.5 GB. [2018-11-23 14:09:04,066 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:09:04,066 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.58 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:09:04,066 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.93 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:09:04,067 INFO L168 Benchmark]: Boogie Preprocessor took 51.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -216.3 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 14:09:04,067 INFO L168 Benchmark]: RCFGBuilder took 210.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2018-11-23 14:09:04,068 INFO L168 Benchmark]: BuchiAutomizer took 7947.72 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 209.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -117.1 MB). Peak memory consumption was 92.1 MB. Max. memory is 11.5 GB. [2018-11-23 14:09:04,068 INFO L168 Benchmark]: Witness Printer took 3.23 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:09:04,070 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 154.58 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.93 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -216.3 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 210.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7947.72 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 209.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -117.1 MB). Peak memory consumption was 92.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.23 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 8 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 6.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 82 SDtfs, 58 SDslu, 139 SDs, 0 SdLazy, 251 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital372 mio100 ax100 hnf100 lsp97 ukn39 mio100 lsp27 div100 bol100 ite100 ukn100 eq182 hnf89 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...