./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_72ceba68-63dd-4969-a3ad-8aa82a79d1f3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_72ceba68-63dd-4969-a3ad-8aa82a79d1f3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_72ceba68-63dd-4969-a3ad-8aa82a79d1f3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_72ceba68-63dd-4969-a3ad-8aa82a79d1f3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_72ceba68-63dd-4969-a3ad-8aa82a79d1f3/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_72ceba68-63dd-4969-a3ad-8aa82a79d1f3/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 205669a0469477740fa35099dd0e4ee1e635b686 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 12:22:00,249 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:22:00,250 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:22:00,256 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:22:00,257 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:22:00,257 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:22:00,258 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:22:00,259 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:22:00,260 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:22:00,261 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:22:00,262 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:22:00,262 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:22:00,263 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:22:00,263 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:22:00,264 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:22:00,264 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:22:00,265 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:22:00,266 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:22:00,268 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:22:00,269 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:22:00,269 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:22:00,270 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:22:00,271 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:22:00,271 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:22:00,271 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:22:00,272 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:22:00,272 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:22:00,273 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:22:00,273 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:22:00,274 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:22:00,274 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:22:00,274 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:22:00,274 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:22:00,274 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:22:00,275 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:22:00,275 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:22:00,276 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_72ceba68-63dd-4969-a3ad-8aa82a79d1f3/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 12:22:00,285 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:22:00,285 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:22:00,286 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:22:00,286 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:22:00,286 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:22:00,287 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 12:22:00,287 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 12:22:00,287 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 12:22:00,287 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 12:22:00,287 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 12:22:00,287 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 12:22:00,287 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:22:00,288 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 12:22:00,288 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:22:00,288 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:22:00,288 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 12:22:00,288 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 12:22:00,288 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 12:22:00,289 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:22:00,289 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 12:22:00,289 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:22:00,289 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 12:22:00,289 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:22:00,289 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:22:00,290 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 12:22:00,290 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:22:00,290 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:22:00,290 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 12:22:00,291 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 12:22:00,291 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_72ceba68-63dd-4969-a3ad-8aa82a79d1f3/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 -> 205669a0469477740fa35099dd0e4ee1e635b686 [2018-11-23 12:22:00,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:22:00,324 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:22:00,326 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:22:00,327 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:22:00,327 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:22:00,328 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_72ceba68-63dd-4969-a3ad-8aa82a79d1f3/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2_true-termination.c.i [2018-11-23 12:22:00,366 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_72ceba68-63dd-4969-a3ad-8aa82a79d1f3/bin-2019/uautomizer/data/2f5b0d862/acd4e017c54640469eacded683bade5a/FLAG91d2ea62b [2018-11-23 12:22:00,775 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:22:00,775 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_72ceba68-63dd-4969-a3ad-8aa82a79d1f3/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2_true-termination.c.i [2018-11-23 12:22:00,779 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_72ceba68-63dd-4969-a3ad-8aa82a79d1f3/bin-2019/uautomizer/data/2f5b0d862/acd4e017c54640469eacded683bade5a/FLAG91d2ea62b [2018-11-23 12:22:00,790 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_72ceba68-63dd-4969-a3ad-8aa82a79d1f3/bin-2019/uautomizer/data/2f5b0d862/acd4e017c54640469eacded683bade5a [2018-11-23 12:22:00,792 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:22:00,793 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:22:00,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:22:00,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:22:00,796 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:22:00,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:22:00" (1/1) ... [2018-11-23 12:22:00,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@431278ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:22:00, skipping insertion in model container [2018-11-23 12:22:00,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:22:00" (1/1) ... [2018-11-23 12:22:00,804 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:22:00,816 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:22:00,919 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:22:00,925 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:22:00,934 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:22:00,943 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:22:00,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:22:00 WrapperNode [2018-11-23 12:22:00,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:22:00,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:22:00,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:22:00,944 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:22:00,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:22:00" (1/1) ... [2018-11-23 12:22:00,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:22:00" (1/1) ... [2018-11-23 12:22:00,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:22:00,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:22:00,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:22:00,968 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:22:01,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:22:00" (1/1) ... [2018-11-23 12:22:01,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:22:00" (1/1) ... [2018-11-23 12:22:01,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:22:00" (1/1) ... [2018-11-23 12:22:01,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:22:00" (1/1) ... [2018-11-23 12:22:01,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:22:00" (1/1) ... [2018-11-23 12:22:01,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:22:00" (1/1) ... [2018-11-23 12:22:01,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:22:00" (1/1) ... [2018-11-23 12:22:01,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:22:01,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:22:01,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:22:01,020 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:22:01,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:22:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72ceba68-63dd-4969-a3ad-8aa82a79d1f3/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:22:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:22:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-11-23 12:22:01,061 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-11-23 12:22:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:22:01,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:22:01,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:22:01,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:22:01,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:22:01,225 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:22:01,225 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 12:22:01,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:22:01 BoogieIcfgContainer [2018-11-23 12:22:01,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:22:01,226 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 12:22:01,226 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 12:22:01,229 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 12:22:01,230 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:22:01,230 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 12:22:00" (1/3) ... [2018-11-23 12:22:01,231 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@432953cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:22:01, skipping insertion in model container [2018-11-23 12:22:01,231 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:22:01,231 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:22:00" (2/3) ... [2018-11-23 12:22:01,231 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@432953cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:22:01, skipping insertion in model container [2018-11-23 12:22:01,231 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:22:01,232 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:22:01" (3/3) ... [2018-11-23 12:22:01,233 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex2_true-termination.c.i [2018-11-23 12:22:01,282 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:22:01,283 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 12:22:01,283 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 12:22:01,283 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 12:22:01,283 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:22:01,284 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:22:01,284 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 12:22:01,284 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:22:01,284 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 12:22:01,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-23 12:22:01,318 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-23 12:22:01,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:22:01,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:22:01,325 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 12:22:01,325 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:22:01,325 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 12:22:01,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-23 12:22:01,327 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-23 12:22:01,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:22:01,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:22:01,327 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 12:22:01,327 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:22:01,334 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 7#L23-3true [2018-11-23 12:22:01,335 INFO L796 eck$LassoCheckResult]: Loop: 7#L23-3true call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 12#L23-1true assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 3#L26true call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 4#recENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 10#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 15#recFINALtrue assume true; 13#recEXITtrue >#31#return; 17#L26-1true call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret12; 7#L23-3true [2018-11-23 12:22:01,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:01,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2018-11-23 12:22:01,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:01,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:01,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:01,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:22:01,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:01,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:01,439 INFO L82 PathProgramCache]: Analyzing trace with hash -5927165, now seen corresponding path program 1 times [2018-11-23 12:22:01,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:01,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:01,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:01,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:22:01,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:22:01,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:22:01,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:22:01,575 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 12:22:01,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:22:01,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:22:01,591 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 7 states. [2018-11-23 12:22:01,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:01,662 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-23 12:22:01,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:22:01,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2018-11-23 12:22:01,666 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-23 12:22:01,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2018-11-23 12:22:01,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 12:22:01,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 12:22:01,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2018-11-23 12:22:01,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 12:22:01,675 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-23 12:22:01,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2018-11-23 12:22:01,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 12:22:01,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:22:01,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-11-23 12:22:01,698 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-23 12:22:01,698 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-23 12:22:01,698 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 12:22:01,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2018-11-23 12:22:01,699 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-23 12:22:01,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:22:01,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:22:01,700 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 12:22:01,700 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:22:01,700 INFO L794 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 49#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 50#L23-3 [2018-11-23 12:22:01,700 INFO L796 eck$LassoCheckResult]: Loop: 50#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 53#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 46#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 51#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 45#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 47#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 51#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 45#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 48#recFINAL assume true; 54#recEXIT >#29#return; 55#L17-1 #res := #t~ret6;havoc #t~ret6; 56#recFINAL assume true; 58#recEXIT >#31#return; 57#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret12; 50#L23-3 [2018-11-23 12:22:01,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:01,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2018-11-23 12:22:01,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:01,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:01,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:01,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:22:01,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:01,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:01,713 INFO L82 PathProgramCache]: Analyzing trace with hash -741726607, now seen corresponding path program 1 times [2018-11-23 12:22:01,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:01,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:01,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:01,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:22:01,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:01,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:22:01,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:22:01,856 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72ceba68-63dd-4969-a3ad-8aa82a79d1f3/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:22:01,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:22:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:01,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:01,959 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 23 treesize of output 33 [2018-11-23 12:22:01,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2018-11-23 12:22:01,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:01,986 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 20 treesize of output 19 [2018-11-23 12:22:01,986 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:01,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:01,997 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 1 xjuncts. [2018-11-23 12:22:01,997 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-23 12:22:02,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:22:02,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:22:02,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-23 12:22:02,108 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 12:22:02,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:22:02,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:22:02,109 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 14 states. [2018-11-23 12:22:02,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:02,288 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-23 12:22:02,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:22:02,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2018-11-23 12:22:02,289 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-23 12:22:02,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2018-11-23 12:22:02,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 12:22:02,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 12:22:02,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2018-11-23 12:22:02,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 12:22:02,291 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-23 12:22:02,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2018-11-23 12:22:02,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 12:22:02,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:22:02,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-23 12:22:02,293 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-23 12:22:02,293 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-23 12:22:02,293 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 12:22:02,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-11-23 12:22:02,294 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-23 12:22:02,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:22:02,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:22:02,295 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 12:22:02,295 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-23 12:22:02,295 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 136#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 137#L23-3 [2018-11-23 12:22:02,295 INFO L796 eck$LassoCheckResult]: Loop: 137#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 144#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 140#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 142#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 138#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 139#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 142#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 138#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 139#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 142#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 138#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 141#recFINAL assume true; 145#recEXIT >#29#return; 146#L17-1 #res := #t~ret6;havoc #t~ret6; 147#recFINAL assume true; 152#recEXIT >#29#return; 150#L17-1 #res := #t~ret6;havoc #t~ret6; 151#recFINAL assume true; 149#recEXIT >#31#return; 148#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret12; 137#L23-3 [2018-11-23 12:22:02,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:02,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2018-11-23 12:22:02,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:02,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:02,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:02,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:22:02,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:02,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:02,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1620168125, now seen corresponding path program 2 times [2018-11-23 12:22:02,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:02,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:02,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:02,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:22:02,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:02,425 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:22:02,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:22:02,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72ceba68-63dd-4969-a3ad-8aa82a79d1f3/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:22:02,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:22:02,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:22:02,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:22:02,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:02,507 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 23 treesize of output 33 [2018-11-23 12:22:02,512 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 24 treesize of output 23 [2018-11-23 12:22:02,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:02,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:02,541 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 1 xjuncts. [2018-11-23 12:22:02,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-11-23 12:22:02,641 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:22:02,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:22:02,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-11-23 12:22:02,657 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 12:22:02,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:22:02,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:22:02,657 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 17 states. [2018-11-23 12:22:02,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:02,754 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 12:22:02,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:22:02,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2018-11-23 12:22:02,755 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-23 12:22:02,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 12:22:02,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 12:22:02,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 12:22:02,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2018-11-23 12:22:02,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 12:22:02,757 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 12:22:02,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2018-11-23 12:22:02,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 12:22:02,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:22:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 12:22:02,760 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 12:22:02,760 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 12:22:02,760 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 12:22:02,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:22:02,761 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-23 12:22:02,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:22:02,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:22:02,762 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 12:22:02,762 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-23 12:22:02,762 INFO L794 eck$LassoCheckResult]: Stem: 261#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 254#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 255#L23-3 [2018-11-23 12:22:02,762 INFO L796 eck$LassoCheckResult]: Loop: 255#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 262#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 258#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 260#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 256#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 257#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 260#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 256#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 257#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 260#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 256#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 257#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 260#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 256#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 259#recFINAL assume true; 273#recEXIT >#29#return; 266#L17-1 #res := #t~ret6;havoc #t~ret6; 265#recFINAL assume true; 263#recEXIT >#29#return; 264#L17-1 #res := #t~ret6;havoc #t~ret6; 272#recFINAL assume true; 271#recEXIT >#29#return; 269#L17-1 #res := #t~ret6;havoc #t~ret6; 270#recFINAL assume true; 268#recEXIT >#31#return; 267#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret12; 255#L23-3 [2018-11-23 12:22:02,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:02,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 4 times [2018-11-23 12:22:02,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:02,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:02,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:02,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:22:02,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:02,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:02,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1930575665, now seen corresponding path program 3 times [2018-11-23 12:22:02,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:02,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:02,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:02,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:22:02,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:02,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:02,834 INFO L82 PathProgramCache]: Analyzing trace with hash 650376563, now seen corresponding path program 1 times [2018-11-23 12:22:02,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:02,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:02,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:02,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:22:02,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:03,182 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2018-11-23 12:22:03,496 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 110 [2018-11-23 12:22:03,899 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 118 [2018-11-23 12:22:04,404 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 122 [2018-11-23 12:22:04,523 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 12:22:04,524 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 12:22:04,524 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 12:22:04,524 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 12:22:04,524 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 12:22:04,524 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:22:04,524 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 12:22:04,524 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 12:22:04,525 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2_true-termination.c.i_Iteration4_Lasso [2018-11-23 12:22:04,525 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 12:22:04,525 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 12:22:04,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:04,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:04,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:04,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:04,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:04,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:04,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:04,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:04,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:04,836 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 12:22:04,839 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 12:22:04,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:04,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:04,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:04,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:04,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:04,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:04,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:04,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:04,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:04,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:04,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:04,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:04,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:04,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:04,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:04,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:04,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:04,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:04,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:04,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:04,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:04,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:04,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:04,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:04,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:04,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:04,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:04,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:04,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:04,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:04,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:04,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:04,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:04,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:04,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:04,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:04,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:04,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:04,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:04,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:04,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:04,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:22:04,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:22:04,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:04,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:04,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:04,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:04,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:04,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:04,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:22:04,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:22:04,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:04,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:04,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:04,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:04,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:04,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:04,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:04,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:04,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:04,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:04,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:04,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:04,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:04,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:04,878 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 12:22:04,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:04,878 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 12:22:04,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:04,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:04,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:04,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:04,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:04,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:04,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:04,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:04,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:04,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:04,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:04,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:04,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:04,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:04,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:04,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:04,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:04,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:04,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:04,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:04,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:04,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:04,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:04,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:04,892 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 12:22:04,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:04,892 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 12:22:04,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:04,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:04,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:04,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:04,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:04,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:04,894 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 12:22:04,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:04,898 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 12:22:04,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:04,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:04,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:04,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:04,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:04,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:04,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:04,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:22:04,902 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:22:04,922 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 12:22:04,928 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 12:22:04,928 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 12:22:04,931 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 12:22:04,932 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 12:22:04,932 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 12:22:04,932 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~ip~0.base) ULTIMATE.start_main_~ip~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~ip~0.base) ULTIMATE.start_main_~ip~0.offset)_1 Supporting invariants [] [2018-11-23 12:22:04,951 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 12:22:04,956 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:22:04,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:04,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:05,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:05,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,040 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 12:22:05,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:05,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 12:22:05,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-23 12:22:05,051 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:05,054 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:05,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:05,065 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2018-11-23 12:22:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 12:22:05,144 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2018-11-23 12:22:05,145 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 9 states. [2018-11-23 12:22:05,246 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand 9 states. Result 66 states and 73 transitions. Complement of second has 24 states. [2018-11-23 12:22:05,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-23 12:22:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:22:05,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2018-11-23 12:22:05,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 14 transitions. Stem has 2 letters. Loop has 26 letters. [2018-11-23 12:22:05,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:22:05,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 14 transitions. Stem has 28 letters. Loop has 26 letters. [2018-11-23 12:22:05,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:22:05,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 14 transitions. Stem has 2 letters. Loop has 52 letters. [2018-11-23 12:22:05,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:22:05,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 73 transitions. [2018-11-23 12:22:05,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 12:22:05,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 35 states and 40 transitions. [2018-11-23 12:22:05,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 12:22:05,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 12:22:05,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2018-11-23 12:22:05,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 12:22:05,253 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-23 12:22:05,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2018-11-23 12:22:05,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-11-23 12:22:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:22:05,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 12:22:05,257 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 12:22:05,257 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 12:22:05,257 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 12:22:05,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:22:05,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 12:22:05,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:22:05,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:22:05,258 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 12:22:05,258 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 12:22:05,258 INFO L794 eck$LassoCheckResult]: Stem: 502#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 489#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 490#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 503#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 492#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 498#recENTRY [2018-11-23 12:22:05,258 INFO L796 eck$LassoCheckResult]: Loop: 498#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 491#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 493#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 498#recENTRY [2018-11-23 12:22:05,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:05,258 INFO L82 PathProgramCache]: Analyzing trace with hash 36330294, now seen corresponding path program 1 times [2018-11-23 12:22:05,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:05,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:05,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:05,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:22:05,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:05,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:05,268 INFO L82 PathProgramCache]: Analyzing trace with hash 29943, now seen corresponding path program 1 times [2018-11-23 12:22:05,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:05,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:05,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:05,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:22:05,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:05,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:05,276 INFO L82 PathProgramCache]: Analyzing trace with hash -15969886, now seen corresponding path program 1 times [2018-11-23 12:22:05,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:05,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:05,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:05,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:22:05,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:05,652 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2018-11-23 12:22:05,787 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 12:22:05,787 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 12:22:05,787 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 12:22:05,787 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 12:22:05,787 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 12:22:05,787 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:22:05,787 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 12:22:05,787 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 12:22:05,788 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2_true-termination.c.i_Iteration5_Lasso [2018-11-23 12:22:05,788 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 12:22:05,788 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 12:22:05,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,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-11-23 12:22:05,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-11-23 12:22:05,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,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-11-23 12:22:05,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-11-23 12:22:05,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-11-23 12:22:05,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-11-23 12:22:05,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-11-23 12:22:05,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:05,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:06,108 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 12:22:06,108 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 12:22:06,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:06,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:06,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:06,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:06,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:06,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:06,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:06,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:06,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:06,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:06,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:06,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:06,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:06,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:06,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:06,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:06,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:06,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:06,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:06,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:06,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:06,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:06,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:06,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:06,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:06,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:06,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:06,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:06,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:06,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:06,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:06,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:06,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:06,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:06,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:06,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:06,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:06,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:06,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:06,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:06,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:06,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:06,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:06,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:06,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:06,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:06,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:06,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:06,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:06,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:06,125 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:22:06,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:22:06,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:06,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:06,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:06,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:06,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:06,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:06,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:06,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:06,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:06,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:06,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:06,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:06,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:06,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:06,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:06,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:06,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:06,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:06,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:06,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:06,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:06,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:06,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:06,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:06,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:06,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:06,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:06,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:06,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:06,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:06,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:06,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:06,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:06,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:06,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:06,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:06,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:06,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:06,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:06,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:06,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:06,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:06,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:06,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:06,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:06,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:06,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:06,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:06,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:06,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:06,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:06,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:06,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:06,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:06,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:06,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:06,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:06,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:06,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:06,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:06,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:06,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:06,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:06,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:06,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:06,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:06,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:06,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:06,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:06,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:22:06,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:22:06,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:06,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:06,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:06,149 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:22:06,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:06,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:06,150 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:22:06,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:22:06,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:06,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:06,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:06,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:06,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:06,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:06,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:22:06,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:22:06,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:06,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:06,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:06,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:06,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:06,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:06,160 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:22:06,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:22:06,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:06,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:06,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:06,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:06,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:06,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:06,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:22:06,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:22:06,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:06,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:06,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:06,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:06,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:06,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:06,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:22:06,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:22:06,181 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 12:22:06,186 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 12:22:06,186 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 12:22:06,186 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 12:22:06,187 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 12:22:06,187 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 12:22:06,187 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1 + 1 Supporting invariants [] [2018-11-23 12:22:06,193 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 12:22:06,195 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:22:06,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:06,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:06,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:06,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-23 12:22:06,253 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,254 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 37 treesize of output 26 [2018-11-23 12:22:06,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-23 12:22:06,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:22:06,280 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 12:22:06,280 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 33 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-23 12:22:06,313 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 33 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 57 states and 66 transitions. Complement of second has 14 states. [2018-11-23 12:22:06,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 12:22:06,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:22:06,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-11-23 12:22:06,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-23 12:22:06,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:22:06,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-23 12:22:06,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:22:06,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-23 12:22:06,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:22:06,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 66 transitions. [2018-11-23 12:22:06,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 12:22:06,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 40 states and 48 transitions. [2018-11-23 12:22:06,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 12:22:06,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 12:22:06,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 48 transitions. [2018-11-23 12:22:06,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 12:22:06,318 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 12:22:06,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 48 transitions. [2018-11-23 12:22:06,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 12:22:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:22:06,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 12:22:06,320 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 12:22:06,321 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 12:22:06,321 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 12:22:06,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2018-11-23 12:22:06,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 12:22:06,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:22:06,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:22:06,322 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-23 12:22:06,322 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 12:22:06,323 INFO L794 eck$LassoCheckResult]: Stem: 656#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 652#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 653#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 669#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 671#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 685#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 684#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 664#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 682#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 681#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 665#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 682#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 681#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 665#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 682#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 678#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 679#recFINAL assume true; 683#recEXIT >#29#return; 661#L17-1 #res := #t~ret6;havoc #t~ret6; 666#recFINAL assume true; 677#recEXIT >#29#return; 675#L17-1 #res := #t~ret6;havoc #t~ret6; 676#recFINAL assume true; 674#recEXIT >#29#return; 673#L17-1 #res := #t~ret6;havoc #t~ret6; 672#recFINAL assume true; 670#recEXIT >#31#return; 667#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret12; 668#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 657#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 647#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 654#recENTRY [2018-11-23 12:22:06,323 INFO L796 eck$LassoCheckResult]: Loop: 654#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 646#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 648#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 654#recENTRY [2018-11-23 12:22:06,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:06,323 INFO L82 PathProgramCache]: Analyzing trace with hash 770731142, now seen corresponding path program 2 times [2018-11-23 12:22:06,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:06,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:06,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:06,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:22:06,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:22:06,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:22:06,584 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72ceba68-63dd-4969-a3ad-8aa82a79d1f3/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:22:06,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:22:06,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:22:06,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:22:06,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:06,638 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 6 treesize of output 5 [2018-11-23 12:22:06,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 12:22:06,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 12:22:06,647 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,649 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,653 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:18, output treesize:5 [2018-11-23 12:22:06,658 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,659 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 12:22:06,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,668 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 15 treesize of output 17 [2018-11-23 12:22:06,670 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 12 treesize of output 11 [2018-11-23 12:22:06,670 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,673 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,677 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:23 [2018-11-23 12:22:06,920 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-11-23 12:22:06,923 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-11-23 12:22:06,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,934 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 1 xjuncts. [2018-11-23 12:22:06,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:41 [2018-11-23 12:22:06,963 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-11-23 12:22:06,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-11-23 12:22:06,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 12:22:06,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:29 [2018-11-23 12:22:07,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-11-23 12:22:07,012 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 17 treesize of output 13 [2018-11-23 12:22:07,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:07,035 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 17 treesize of output 13 [2018-11-23 12:22:07,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:22:07,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:22:07,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:22:07,043 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:36, output treesize:13 [2018-11-23 12:22:07,058 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:22:07,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:22:07,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 31 [2018-11-23 12:22:07,073 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 12:22:07,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:07,074 INFO L82 PathProgramCache]: Analyzing trace with hash 29943, now seen corresponding path program 2 times [2018-11-23 12:22:07,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:07,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:07,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:07,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:22:07,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:07,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:22:07,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:22:07,243 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 12 Second operand 31 states. [2018-11-23 12:22:07,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:07,599 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2018-11-23 12:22:07,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:22:07,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2018-11-23 12:22:07,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 12:22:07,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 46 states and 58 transitions. [2018-11-23 12:22:07,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 12:22:07,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 12:22:07,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2018-11-23 12:22:07,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 12:22:07,604 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-11-23 12:22:07,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2018-11-23 12:22:07,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-11-23 12:22:07,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:22:07,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2018-11-23 12:22:07,608 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-23 12:22:07,608 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-23 12:22:07,608 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 12:22:07,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2018-11-23 12:22:07,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 12:22:07,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:22:07,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:22:07,610 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-23 12:22:07,610 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 12:22:07,611 INFO L794 eck$LassoCheckResult]: Stem: 891#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 882#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 883#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 893#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 885#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 886#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 908#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 880#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 912#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 910#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 879#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 912#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 910#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 879#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 912#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 910#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 879#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 912#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 878#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 881#recFINAL assume true; 896#recEXIT >#29#return; 897#L17-1 #res := #t~ret6;havoc #t~ret6; 898#recFINAL assume true; 894#recEXIT >#29#return; 895#L17-1 #res := #t~ret6;havoc #t~ret6; 913#recFINAL assume true; 911#recEXIT >#29#return; 907#L17-1 #res := #t~ret6;havoc #t~ret6; 909#recFINAL assume true; 906#recEXIT >#29#return; 905#L17-1 #res := #t~ret6;havoc #t~ret6; 904#recFINAL assume true; 902#recEXIT >#31#return; 899#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret12; 900#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 892#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 877#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 884#recENTRY [2018-11-23 12:22:07,611 INFO L796 eck$LassoCheckResult]: Loop: 884#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 875#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 876#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 884#recENTRY [2018-11-23 12:22:07,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:07,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1655830132, now seen corresponding path program 3 times [2018-11-23 12:22:07,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:07,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:07,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:07,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:22:07,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:07,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:07,654 INFO L82 PathProgramCache]: Analyzing trace with hash 29943, now seen corresponding path program 3 times [2018-11-23 12:22:07,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:07,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:07,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:07,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:22:07,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:07,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:07,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1136068004, now seen corresponding path program 4 times [2018-11-23 12:22:07,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:07,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:07,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:07,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:22:07,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:22:08,163 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2018-11-23 12:22:08,445 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 110 [2018-11-23 12:22:08,821 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 118 [2018-11-23 12:22:09,246 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 126 [2018-11-23 12:22:10,334 WARN L180 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 198 [2018-11-23 12:22:10,498 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-23 12:22:10,706 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-23 12:22:10,847 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-11-23 12:22:10,850 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 12:22:10,851 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 12:22:10,851 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 12:22:10,851 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 12:22:10,851 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 12:22:10,851 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:22:10,851 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 12:22:10,851 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 12:22:10,851 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2_true-termination.c.i_Iteration7_Lasso [2018-11-23 12:22:10,851 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 12:22:10,851 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 12:22:10,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:10,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:10,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:10,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:10,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:10,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:10,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:10,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-11-23 12:22:10,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-11-23 12:22:10,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:10,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-11-23 12:22:10,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-11-23 12:22:10,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-11-23 12:22:10,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-11-23 12:22:10,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-11-23 12:22:10,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-11-23 12:22:10,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-11-23 12:22:10,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-11-23 12:22:10,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-11-23 12:22:10,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-11-23 12:22:10,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-11-23 12:22:10,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-11-23 12:22:10,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-11-23 12:22:10,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-11-23 12:22:10,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-11-23 12:22:10,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-11-23 12:22:10,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-11-23 12:22:10,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-11-23 12:22:10,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-11-23 12:22:11,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:11,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:11,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:11,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:11,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:11,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:22:11,345 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 12:22:11,346 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 12:22:11,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:22:11,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:22:11,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:22:11,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:22:11,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:22:11,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:22:11,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:22:11,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:22:11,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:22:11,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,409 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:22:11,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,409 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:22:11,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:22:11,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,411 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:22:11,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,412 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:22:11,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:22:11,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:22:11,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:22:11,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:22:11,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:22:11,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:22:11,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:22:11,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:22:11,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:22:11,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:22:11,420 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:22:11,431 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 12:22:11,441 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 12:22:11,442 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 12:22:11,442 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 12:22:11,443 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 12:22:11,443 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 12:22:11,443 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_2 + 1 Supporting invariants [] [2018-11-23 12:22:11,526 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-23 12:22:11,527 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:22:11,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:11,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:11,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:11,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:11,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-23 12:22:11,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:11,623 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 37 treesize of output 26 [2018-11-23 12:22:11,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:11,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:11,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:11,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-23 12:22:11,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:22:11,639 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 12:22:11,639 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-23 12:22:11,672 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 50 states and 59 transitions. Complement of second has 14 states. [2018-11-23 12:22:11,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 12:22:11,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:22:11,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-11-23 12:22:11,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 37 letters. Loop has 3 letters. [2018-11-23 12:22:11,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:22:11,674 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 12:22:11,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:11,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:11,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:11,777 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:11,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-23 12:22:11,780 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:11,780 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 37 treesize of output 26 [2018-11-23 12:22:11,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:11,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:11,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:11,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-23 12:22:11,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:22:11,793 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 12:22:11,793 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-23 12:22:11,826 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 50 states and 59 transitions. Complement of second has 14 states. [2018-11-23 12:22:11,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 12:22:11,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:22:11,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-11-23 12:22:11,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 37 letters. Loop has 3 letters. [2018-11-23 12:22:11,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:22:11,827 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 12:22:11,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:11,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:11,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:11,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:11,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-23 12:22:11,914 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:11,914 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 37 treesize of output 26 [2018-11-23 12:22:11,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:11,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:11,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:11,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-23 12:22:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:22:11,933 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 12:22:11,933 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-23 12:22:11,987 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 63 states and 72 transitions. Complement of second has 15 states. [2018-11-23 12:22:11,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 12:22:11,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:22:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-11-23 12:22:11,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 37 letters. Loop has 3 letters. [2018-11-23 12:22:11,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:22:11,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 40 letters. Loop has 3 letters. [2018-11-23 12:22:11,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:22:11,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 37 letters. Loop has 6 letters. [2018-11-23 12:22:11,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:22:11,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 72 transitions. [2018-11-23 12:22:11,990 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 12:22:11,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 0 states and 0 transitions. [2018-11-23 12:22:11,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 12:22:11,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 12:22:11,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 12:22:11,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 12:22:11,990 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:22:11,991 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:22:11,991 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:22:11,991 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 12:22:11,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:22:11,991 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 12:22:11,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 12:22:11,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 12:22:11 BoogieIcfgContainer [2018-11-23 12:22:11,996 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 12:22:11,996 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:22:11,996 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:22:11,996 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:22:11,996 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:22:01" (3/4) ... [2018-11-23 12:22:11,999 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 12:22:11,999 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:22:12,000 INFO L168 Benchmark]: Toolchain (without parser) took 11206.92 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 282.1 MB). Free memory was 961.9 MB in the beginning and 1.1 GB in the end (delta: -145.8 MB). Peak memory consumption was 136.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:22:12,000 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:22:12,000 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.76 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:22:12,001 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.49 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:22:12,001 INFO L168 Benchmark]: Boogie Preprocessor took 52.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:22:12,002 INFO L168 Benchmark]: RCFGBuilder took 205.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:22:12,002 INFO L168 Benchmark]: BuchiAutomizer took 10770.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -848.1 kB). Peak memory consumption was 154.9 MB. Max. memory is 11.5 GB. [2018-11-23 12:22:12,002 INFO L168 Benchmark]: Witness Printer took 3.19 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:22:12,004 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 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 149.76 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 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 23.49 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 205.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10770.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -848.1 kB). Peak memory consumption was 154.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.19 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[ip][ip] and consists of 9 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.7s and 8 iterations. TraceHistogramMax:5. Analysis of lassos took 8.9s. Construction of modules took 0.5s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 43 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 30/30 HoareTripleCheckerStatistics: 82 SDtfs, 59 SDslu, 242 SDs, 0 SdLazy, 717 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital335 mio100 ax100 hnf100 lsp97 ukn52 mio100 lsp29 div100 bol100 ite100 ukn100 eq188 hnf88 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...