./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5047e050-a704-4d9b-812b-c58f94dbc588/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5047e050-a704-4d9b-812b-c58f94dbc588/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5047e050-a704-4d9b-812b-c58f94dbc588/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5047e050-a704-4d9b-812b-c58f94dbc588/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5047e050-a704-4d9b-812b-c58f94dbc588/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5047e050-a704-4d9b-812b-c58f94dbc588/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 2e31c843d33c80f978b3ed5615692b93565f0ae0 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 12:20:25,068 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 12:20:25,069 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 12:20:25,075 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 12:20:25,075 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 12:20:25,076 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 12:20:25,076 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 12:20:25,077 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 12:20:25,078 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 12:20:25,078 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 12:20:25,079 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 12:20:25,079 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 12:20:25,079 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 12:20:25,080 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 12:20:25,080 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 12:20:25,081 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 12:20:25,081 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 12:20:25,082 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 12:20:25,083 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 12:20:25,083 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 12:20:25,084 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 12:20:25,084 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 12:20:25,085 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 12:20:25,086 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 12:20:25,086 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 12:20:25,086 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 12:20:25,087 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 12:20:25,087 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 12:20:25,087 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 12:20:25,088 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 12:20:25,088 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 12:20:25,088 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 12:20:25,088 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 12:20:25,089 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 12:20:25,089 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 12:20:25,089 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 12:20:25,089 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5047e050-a704-4d9b-812b-c58f94dbc588/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 12:20:25,097 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 12:20:25,097 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 12:20:25,098 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 12:20:25,098 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 12:20:25,098 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 12:20:25,098 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 12:20:25,098 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 12:20:25,098 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 12:20:25,098 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 12:20:25,098 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 12:20:25,098 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 12:20:25,098 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 12:20:25,098 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 12:20:25,098 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 12:20:25,099 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 12:20:25,099 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 12:20:25,099 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 12:20:25,099 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 12:20:25,099 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 12:20:25,099 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 12:20:25,099 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 12:20:25,099 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 12:20:25,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 12:20:25,099 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 12:20:25,099 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 12:20:25,099 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 12:20:25,099 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 12:20:25,100 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 12:20:25,100 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 12:20:25,100 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_5047e050-a704-4d9b-812b-c58f94dbc588/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 -> 2e31c843d33c80f978b3ed5615692b93565f0ae0 [2018-12-08 12:20:25,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 12:20:25,123 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 12:20:25,125 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 12:20:25,126 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 12:20:25,126 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 12:20:25,127 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5047e050-a704-4d9b-812b-c58f94dbc588/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11_true-termination.c.i [2018-12-08 12:20:25,162 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5047e050-a704-4d9b-812b-c58f94dbc588/bin-2019/uautomizer/data/8d11ce6dc/ce1fec832508444db5a6994e12afada7/FLAGf6dfe757e [2018-12-08 12:20:25,497 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 12:20:25,498 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5047e050-a704-4d9b-812b-c58f94dbc588/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11_true-termination.c.i [2018-12-08 12:20:25,503 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5047e050-a704-4d9b-812b-c58f94dbc588/bin-2019/uautomizer/data/8d11ce6dc/ce1fec832508444db5a6994e12afada7/FLAGf6dfe757e [2018-12-08 12:20:25,901 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5047e050-a704-4d9b-812b-c58f94dbc588/bin-2019/uautomizer/data/8d11ce6dc/ce1fec832508444db5a6994e12afada7 [2018-12-08 12:20:25,903 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 12:20:25,904 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 12:20:25,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 12:20:25,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 12:20:25,907 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 12:20:25,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:20:25" (1/1) ... [2018-12-08 12:20:25,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2778df3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:20:25, skipping insertion in model container [2018-12-08 12:20:25,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:20:25" (1/1) ... [2018-12-08 12:20:25,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 12:20:25,922 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 12:20:26,003 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:20:26,009 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 12:20:26,018 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:20:26,026 INFO L195 MainTranslator]: Completed translation [2018-12-08 12:20:26,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:20:26 WrapperNode [2018-12-08 12:20:26,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 12:20:26,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 12:20:26,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 12:20:26,027 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 12:20:26,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:20:26" (1/1) ... [2018-12-08 12:20:26,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:20:26" (1/1) ... [2018-12-08 12:20:26,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 12:20:26,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 12:20:26,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 12:20:26,047 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 12:20:26,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:20:26" (1/1) ... [2018-12-08 12:20:26,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:20:26" (1/1) ... [2018-12-08 12:20:26,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:20:26" (1/1) ... [2018-12-08 12:20:26,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:20:26" (1/1) ... [2018-12-08 12:20:26,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:20:26" (1/1) ... [2018-12-08 12:20:26,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:20:26" (1/1) ... [2018-12-08 12:20:26,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:20:26" (1/1) ... [2018-12-08 12:20:26,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 12:20:26,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 12:20:26,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 12:20:26,059 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 12:20:26,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:20:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5047e050-a704-4d9b-812b-c58f94dbc588/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:20:26,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 12:20:26,121 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-12-08 12:20:26,121 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-12-08 12:20:26,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 12:20:26,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 12:20:26,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 12:20:26,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 12:20:26,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 12:20:26,227 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 12:20:26,227 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-08 12:20:26,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:20:26 BoogieIcfgContainer [2018-12-08 12:20:26,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 12:20:26,228 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 12:20:26,228 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 12:20:26,230 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 12:20:26,231 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 12:20:26,231 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 12:20:25" (1/3) ... [2018-12-08 12:20:26,232 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2431fd37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 12:20:26, skipping insertion in model container [2018-12-08 12:20:26,232 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 12:20:26,232 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:20:26" (2/3) ... [2018-12-08 12:20:26,232 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2431fd37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 12:20:26, skipping insertion in model container [2018-12-08 12:20:26,232 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 12:20:26,232 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:20:26" (3/3) ... [2018-12-08 12:20:26,233 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11_true-termination.c.i [2018-12-08 12:20:26,263 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 12:20:26,264 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 12:20:26,264 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 12:20:26,264 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 12:20:26,264 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 12:20:26,264 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 12:20:26,264 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 12:20:26,264 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 12:20:26,264 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 12:20:26,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-08 12:20:26,288 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-08 12:20:26,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:20:26,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:20:26,293 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 12:20:26,293 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:20:26,293 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 12:20:26,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-08 12:20:26,294 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-08 12:20:26,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:20:26,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:20:26,295 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 12:20:26,295 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:20:26,300 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true havoc main_#res;havoc main_#t~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; 19#L28-3true [2018-12-08 12:20:26,300 INFO L796 eck$LassoCheckResult]: Loop: 19#L28-3true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 4#L28-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); 9#L32true assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 20#L36true 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); 6#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; 14#recFINALtrue assume true; 12#recEXITtrue >#44#return; 18#L36-1true assume -1 == main_#t~ret12;main_#t~ite13 := -1; 11#L36-3true call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ret12;havoc main_#t~ite13; 19#L28-3true [2018-12-08 12:20:26,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:20:26,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2018-12-08 12:20:26,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:20:26,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:20:26,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:26,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:20:26,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:20:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:20:26,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:20:26,371 INFO L82 PathProgramCache]: Analyzing trace with hash -2107477180, now seen corresponding path program 1 times [2018-12-08 12:20:26,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:20:26,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:20:26,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:26,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:20:26,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:20:26,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:20:26,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:20:26,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 12:20:26,472 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 12:20:26,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 12:20:26,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 12:20:26,482 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2018-12-08 12:20:26,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:20:26,535 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-12-08 12:20:26,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 12:20:26,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-12-08 12:20:26,538 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-08 12:20:26,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 19 transitions. [2018-12-08 12:20:26,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-08 12:20:26,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-08 12:20:26,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-12-08 12:20:26,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:20:26,545 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-08 12:20:26,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-12-08 12:20:26,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-08 12:20:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-08 12:20:26,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-12-08 12:20:26,563 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-08 12:20:26,564 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-08 12:20:26,564 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 12:20:26,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-12-08 12:20:26,564 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-08 12:20:26,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:20:26,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:20:26,565 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 12:20:26,565 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:20:26,565 INFO L794 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 57#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; 58#L28-3 [2018-12-08 12:20:26,565 INFO L796 eck$LassoCheckResult]: Loop: 58#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 55#L28-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); 56#L32 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#L36 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;call ULTIMATE.dealloc(~op.base, ~op.offset); 53#L19 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; 59#recFINAL assume true; 64#recEXIT >#42#return; 61#L19-1 #res := #t~ret5;havoc #t~ret5; 62#recFINAL assume true; 66#recEXIT >#44#return; 65#L36-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 63#L36-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ret12;havoc main_#t~ite13; 58#L28-3 [2018-12-08 12:20:26,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:20:26,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2018-12-08 12:20:26,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:20:26,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:20:26,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:26,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:20:26,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:20:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:20:26,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:20:26,574 INFO L82 PathProgramCache]: Analyzing trace with hash 290320444, now seen corresponding path program 1 times [2018-12-08 12:20:26,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:20:26,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:20:26,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:26,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:20:26,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:20:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:20:26,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:20:26,617 INFO L82 PathProgramCache]: Analyzing trace with hash -645910274, now seen corresponding path program 1 times [2018-12-08 12:20:26,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:20:26,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:20:26,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:26,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:20:26,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:20:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:20:26,899 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2018-12-08 12:20:27,354 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 120 [2018-12-08 12:20:27,479 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:20:27,479 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:20:27,480 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:20:27,480 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:20:27,480 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:20:27,480 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:20:27,480 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:20:27,480 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:20:27,480 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11_true-termination.c.i_Iteration2_Lasso [2018-12-08 12:20:27,480 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:20:27,480 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:20:27,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:27,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:27,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:27,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:27,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:27,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:27,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-12-08 12:20:27,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:27,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:27,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:27,825 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:20:27,828 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:20:27,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:27,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:27,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:27,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:27,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:27,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:27,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:27,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:27,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:27,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:27,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:27,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:27,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:27,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:27,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:20:27,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:20:27,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:27,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:27,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:27,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:27,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:27,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:27,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:27,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:27,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:27,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:27,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:27,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:27,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:27,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:27,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:27,855 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:20:27,855 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:20:27,867 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 12:20:27,873 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 12:20:27,873 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 12:20:27,874 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 12:20:27,875 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 12:20:27,875 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 12:20:27,875 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-12-08 12:20:27,884 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-08 12:20:27,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 12:20:27,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:20:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:20:27,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:20:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:20:27,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:20:27,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:20:27,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:20:27,959 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-12-08 12:20:27,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:20:27,970 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-12-08 12:20:27,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 12:20:27,972 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 12:20:27,976 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:20:27,986 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-12-08 12:20:27,986 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:36, output treesize:15 [2018-12-08 12:20:27,997 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-12-08 12:20:27,999 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-12-08 12:20:27,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:20:28,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:20:28,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:20:28,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2018-12-08 12:20:28,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 12:20:28,035 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-12-08 12:20:28,036 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-12-08 12:20:28,114 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-12-08 12:20:28,114 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-12-08 12:20:28,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-08 12:20:28,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-12-08 12:20:28,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 16 letters. [2018-12-08 12:20:28,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:20:28,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 16 letters. [2018-12-08 12:20:28,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:20:28,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 32 letters. [2018-12-08 12:20:28,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:20:28,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 73 transitions. [2018-12-08 12:20:28,120 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-12-08 12:20:28,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 67 transitions. [2018-12-08 12:20:28,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-12-08 12:20:28,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-12-08 12:20:28,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2018-12-08 12:20:28,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:20:28,122 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-12-08 12:20:28,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2018-12-08 12:20:28,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2018-12-08 12:20:28,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-08 12:20:28,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2018-12-08 12:20:28,125 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-12-08 12:20:28,125 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-12-08 12:20:28,125 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 12:20:28,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2018-12-08 12:20:28,126 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-12-08 12:20:28,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:20:28,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:20:28,126 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:20:28,127 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 12:20:28,127 INFO L794 eck$LassoCheckResult]: Stem: 255#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 249#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; 250#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 245#L28-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); 246#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 256#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 274#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 285#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;call ULTIMATE.dealloc(~op.base, ~op.offset); 240#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 238#recENTRY [2018-12-08 12:20:28,127 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;call ULTIMATE.dealloc(~op.base, ~op.offset); 239#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 238#recENTRY [2018-12-08 12:20:28,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:20:28,127 INFO L82 PathProgramCache]: Analyzing trace with hash -498407605, now seen corresponding path program 1 times [2018-12-08 12:20:28,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:20:28,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:20:28,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:28,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:20:28,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:20:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:20:28,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:20:28,150 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 1 times [2018-12-08 12:20:28,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:20:28,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:20:28,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:28,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:20:28,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:20:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:20:28,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:20:28,160 INFO L82 PathProgramCache]: Analyzing trace with hash -359018118, now seen corresponding path program 2 times [2018-12-08 12:20:28,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:20:28,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:20:28,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:28,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:20:28,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:20:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:20:28,590 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-12-08 12:20:28,838 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2018-12-08 12:20:28,888 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:20:28,888 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:20:28,888 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:20:28,888 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:20:28,888 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:20:28,888 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:20:28,888 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:20:28,888 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:20:28,888 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11_true-termination.c.i_Iteration3_Lasso [2018-12-08 12:20:28,888 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:20:28,888 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:20:28,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:28,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:29,180 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:20:29,180 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:20:29,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:20:29,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:20:29,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:20:29,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:20:29,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:29,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:29,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:29,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,231 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:20:29,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:20:29,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,237 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:20:29,237 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 12:20:29,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,239 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-08 12:20:29,239 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:20:29,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:29,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:29,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:29,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:29,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:29,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:29,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:20:29,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:20:29,265 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 12:20:29,285 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-08 12:20:29,285 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-12-08 12:20:29,285 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 12:20:29,286 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 12:20:29,286 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 12:20:29,286 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) 0)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) 0)_1 + 1 Supporting invariants [] [2018-12-08 12:20:29,292 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2018-12-08 12:20:29,294 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 12:20:29,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:20:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:20:29,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:20:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:20:29,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:20:29,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:20:29,402 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-12-08 12:20:29,406 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 52 treesize of output 44 [2018-12-08 12:20:29,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:20:29,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:20:29,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-12-08 12:20:29,431 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 12:20:29,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 12:20:29,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 12:20:29,455 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:39, output treesize:60 [2018-12-08 12:20:29,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:20:29,477 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-12-08 12:20:29,477 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-12-08 12:20:29,550 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 99 states and 122 transitions. Complement of second has 18 states. [2018-12-08 12:20:29,551 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-12-08 12:20:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 12:20:29,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-12-08 12:20:29,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2018-12-08 12:20:29,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:20:29,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2018-12-08 12:20:29,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:20:29,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2018-12-08 12:20:29,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:20:29,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. [2018-12-08 12:20:29,554 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-12-08 12:20:29,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 87 states and 110 transitions. [2018-12-08 12:20:29,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-12-08 12:20:29,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-12-08 12:20:29,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2018-12-08 12:20:29,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:20:29,556 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2018-12-08 12:20:29,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2018-12-08 12:20:29,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-12-08 12:20:29,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-08 12:20:29,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2018-12-08 12:20:29,561 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-12-08 12:20:29,561 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-12-08 12:20:29,561 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 12:20:29,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 102 transitions. [2018-12-08 12:20:29,562 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-12-08 12:20:29,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:20:29,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:20:29,563 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:20:29,563 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:20:29,563 INFO L794 eck$LassoCheckResult]: Stem: 497#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 490#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; 491#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 517#L28-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); 557#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 529#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 555#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 554#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;call ULTIMATE.dealloc(~op.base, ~op.offset); 479#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 478#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 481#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; 489#recFINAL assume true; 512#recEXIT >#42#return; 538#L19-1 #res := #t~ret5;havoc #t~ret5; 537#recFINAL assume true; 528#recEXIT >#44#return; 515#L36-1 assume !(-1 == main_#t~ret12);main_#t~ite13 := 1; 506#L36-3 [2018-12-08 12:20:29,563 INFO L796 eck$LassoCheckResult]: Loop: 506#L36-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ret12;havoc main_#t~ite13; 507#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 539#L28-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); 534#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 519#L36 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); 544#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;call ULTIMATE.dealloc(~op.base, ~op.offset); 532#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 520#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 544#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; 545#recFINAL assume true; 543#recEXIT >#42#return; 533#L19-1 #res := #t~ret5;havoc #t~ret5; 541#recFINAL assume true; 531#recEXIT >#44#return; 526#L36-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 506#L36-3 [2018-12-08 12:20:29,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:20:29,563 INFO L82 PathProgramCache]: Analyzing trace with hash -713572475, now seen corresponding path program 1 times [2018-12-08 12:20:29,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:20:29,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:20:29,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:29,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:20:29,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:20:29,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:20:29,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:20:29,647 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5047e050-a704-4d9b-812b-c58f94dbc588/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 12:20:29,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:20:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:20:29,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:20:29,701 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-12-08 12:20:29,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-08 12:20:29,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:20:29,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:20:29,723 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-12-08 12:20:29,723 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 12:20:29,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 12:20:29,739 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-12-08 12:20:29,740 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:25, output treesize:31 [2018-12-08 12:20:29,770 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 12:20:29,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:20:29,774 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-12-08 12:20:29,776 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-12-08 12:20:29,776 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 12:20:29,777 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:20:29,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:20:29,777 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:51, output treesize:5 [2018-12-08 12:20:29,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:20:29,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:20:29,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-12-08 12:20:29,809 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 12:20:29,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:20:29,809 INFO L82 PathProgramCache]: Analyzing trace with hash 542882406, now seen corresponding path program 2 times [2018-12-08 12:20:29,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:20:29,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:20:29,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:29,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:20:29,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:20:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:20:30,035 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2018-12-08 12:20:30,461 WARN L180 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 126 [2018-12-08 12:20:30,580 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-12-08 12:20:30,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 12:20:30,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-08 12:20:30,581 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. cyclomatic complexity: 26 Second operand 13 states. [2018-12-08 12:20:30,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:20:30,696 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2018-12-08 12:20:30,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 12:20:30,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 110 transitions. [2018-12-08 12:20:30,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 12:20:30,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 54 states and 67 transitions. [2018-12-08 12:20:30,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-08 12:20:30,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-08 12:20:30,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 67 transitions. [2018-12-08 12:20:30,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:20:30,702 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. [2018-12-08 12:20:30,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 67 transitions. [2018-12-08 12:20:30,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-12-08 12:20:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-08 12:20:30,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-12-08 12:20:30,707 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-12-08 12:20:30,707 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-12-08 12:20:30,707 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 12:20:30,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2018-12-08 12:20:30,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 12:20:30,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:20:30,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:20:30,709 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:20:30,709 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 12:20:30,709 INFO L794 eck$LassoCheckResult]: Stem: 734#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 728#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; 729#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 743#L28-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); 733#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 719#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 718#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 720#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;call ULTIMATE.dealloc(~op.base, ~op.offset); 726#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 749#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 725#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; 727#recFINAL assume true; 748#recEXIT >#42#return; 747#L19-1 #res := #t~ret5;havoc #t~ret5; 746#recFINAL assume true; 744#recEXIT >#44#return; 742#L36-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 738#L36-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ret12;havoc main_#t~ite13; 739#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 721#L28-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); 722#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 715#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 714#recENTRY [2018-12-08 12:20:30,710 INFO L796 eck$LassoCheckResult]: Loop: 714#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 716#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;call ULTIMATE.dealloc(~op.base, ~op.offset); 717#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 714#recENTRY [2018-12-08 12:20:30,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:20:30,710 INFO L82 PathProgramCache]: Analyzing trace with hash -873815595, now seen corresponding path program 2 times [2018-12-08 12:20:30,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:20:30,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:20:30,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:30,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:20:30,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:20:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:20:30,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:20:30,742 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 2 times [2018-12-08 12:20:30,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:20:30,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:20:30,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:30,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:20:30,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:20:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:20:30,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:20:30,750 INFO L82 PathProgramCache]: Analyzing trace with hash -43609424, now seen corresponding path program 3 times [2018-12-08 12:20:30,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:20:30,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:20:30,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:30,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:20:30,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:20:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:20:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:20:31,102 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2018-12-08 12:20:31,904 WARN L180 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 186 [2018-12-08 12:20:32,123 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-12-08 12:20:32,298 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-12-08 12:20:32,440 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-12-08 12:20:32,442 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:20:32,442 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:20:32,442 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:20:32,442 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:20:32,442 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:20:32,442 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:20:32,442 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:20:32,442 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:20:32,443 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11_true-termination.c.i_Iteration5_Lasso [2018-12-08 12:20:32,443 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:20:32,443 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:20:32,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:20:32,766 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:20:32,766 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:20:32,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:32,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:32,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:32,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:32,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:32,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:32,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:32,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:32,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:32,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:32,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:32,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:32,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:32,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:32,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:32,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:32,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:32,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:32,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:32,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:32,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:32,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:32,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:32,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:32,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:32,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:32,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:32,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:32,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:32,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:32,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:32,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:32,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:32,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:32,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:32,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:32,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:32,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:32,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:32,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:32,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:32,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:20:32,771 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:20:32,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:32,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:32,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:32,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:20:32,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:32,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:32,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:32,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:20:32,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:20:32,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:32,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:32,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:32,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:32,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:32,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:32,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:20:32,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:20:32,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:32,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:32,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:32,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:32,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:32,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:32,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:20:32,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:20:32,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:32,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:32,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:32,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:32,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:32,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:32,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:20:32,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:20:32,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:32,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:32,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:32,781 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:20:32,781 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 12:20:32,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:32,782 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-08 12:20:32,782 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:20:32,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:32,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:32,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:32,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:32,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:32,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:32,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:20:32,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:20:32,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:32,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:32,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:32,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:32,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:32,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:32,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:20:32,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:20:32,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:32,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:32,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:32,791 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:20:32,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:32,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:32,791 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 12:20:32,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:20:32,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:32,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:32,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:32,793 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:20:32,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:32,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:32,793 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 12:20:32,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:20:32,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:32,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:32,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:32,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:32,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:32,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:32,795 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:20:32,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:20:32,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:32,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:32,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:32,796 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:20:32,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:32,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:32,797 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 12:20:32,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:20:32,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:20:32,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:20:32,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:20:32,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:20:32,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:20:32,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:20:32,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:20:32,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:20:32,804 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 12:20:32,807 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 12:20:32,808 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-08 12:20:32,808 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 12:20:32,808 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 12:20:32,808 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 12:20:32,808 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-12-08 12:20:32,812 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-12-08 12:20:32,812 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 12:20:32,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:20:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:20:32,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:20:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:20:32,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:20:32,897 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-12-08 12:20:32,900 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-12-08 12:20:32,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:20:32,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:20:32,930 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-12-08 12:20:32,931 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 12:20:32,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 12:20:32,953 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-12-08 12:20:32,953 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-12-08 12:20:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:20:32,969 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-12-08 12:20:32,969 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-08 12:20:33,014 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-12-08 12:20:33,014 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-12-08 12:20:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 12:20:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-12-08 12:20:33,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2018-12-08 12:20:33,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:20:33,015 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 12:20:33,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:20:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:20:33,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:20:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:20:33,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:20:33,082 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-12-08 12:20:33,084 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-12-08 12:20:33,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:20:33,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:20:33,109 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-12-08 12:20:33,110 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 12:20:33,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 12:20:33,134 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-12-08 12:20:33,134 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-12-08 12:20:33,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:20:33,149 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-12-08 12:20:33,149 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-08 12:20:33,183 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-12-08 12:20:33,183 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-12-08 12:20:33,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 12:20:33,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-12-08 12:20:33,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2018-12-08 12:20:33,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:20:33,184 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 12:20:33,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:20:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:20:33,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:20:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:20:33,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:20:33,254 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-12-08 12:20:33,256 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-12-08 12:20:33,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:20:33,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:20:33,279 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-12-08 12:20:33,280 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 12:20:33,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 12:20:33,302 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-12-08 12:20:33,302 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-12-08 12:20:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:20:33,317 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-12-08 12:20:33,317 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-08 12:20:33,369 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-12-08 12:20:33,370 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-12-08 12:20:33,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 12:20:33,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-12-08 12:20:33,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 3 letters. [2018-12-08 12:20:33,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:20:33,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2018-12-08 12:20:33,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:20:33,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 6 letters. [2018-12-08 12:20:33,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:20:33,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2018-12-08 12:20:33,372 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 12:20:33,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2018-12-08 12:20:33,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 12:20:33,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 12:20:33,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 12:20:33,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:20:33,372 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 12:20:33,372 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 12:20:33,372 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 12:20:33,372 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 12:20:33,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 12:20:33,372 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 12:20:33,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 12:20:33,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 12:20:33 BoogieIcfgContainer [2018-12-08 12:20:33,376 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 12:20:33,376 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 12:20:33,376 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 12:20:33,377 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 12:20:33,377 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:20:26" (3/4) ... [2018-12-08 12:20:33,379 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 12:20:33,379 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 12:20:33,379 INFO L168 Benchmark]: Toolchain (without parser) took 7475.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.8 MB). Free memory was 953.3 MB in the beginning and 982.4 MB in the end (delta: -29.1 MB). Peak memory consumption was 170.7 MB. Max. memory is 11.5 GB. [2018-12-08 12:20:33,380 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:20:33,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 122.14 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 12:20:33,380 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.40 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:20:33,381 INFO L168 Benchmark]: Boogie Preprocessor took 11.92 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 12:20:33,381 INFO L168 Benchmark]: RCFGBuilder took 169.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -134.1 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-08 12:20:33,381 INFO L168 Benchmark]: BuchiAutomizer took 7147.96 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 103.8 MB). Free memory was 1.1 GB in the beginning and 982.4 MB in the end (delta: 91.6 MB). Peak memory consumption was 195.4 MB. Max. memory is 11.5 GB. [2018-12-08 12:20:33,381 INFO L168 Benchmark]: Witness Printer took 2.63 ms. Allocated memory is still 1.2 GB. Free memory is still 982.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:20:33,383 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 122.14 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 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 19.40 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.92 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 169.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -134.1 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7147.96 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 103.8 MB). Free memory was 1.1 GB in the beginning and 982.4 MB in the end (delta: 91.6 MB). Peak memory consumption was 195.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.63 ms. Allocated memory is still 1.2 GB. Free memory is still 982.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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][0] + 1 and consists of 6 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.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.7s. Construction of modules took 0.2s. 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, 57 SDslu, 144 SDs, 0 SdLazy, 240 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital373 mio100 ax100 hnf100 lsp98 ukn39 mio100 lsp31 div100 bol100 ite100 ukn100 eq199 hnf88 smp100 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...