./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7f8704b9-e07c-4a27-9154-b4f7ab0c6db5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7f8704b9-e07c-4a27-9154-b4f7ab0c6db5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7f8704b9-e07c-4a27-9154-b4f7ab0c6db5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7f8704b9-e07c-4a27-9154-b4f7ab0c6db5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7f8704b9-e07c-4a27-9154-b4f7ab0c6db5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7f8704b9-e07c-4a27-9154-b4f7ab0c6db5/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 f7c8cd0f6441598a9b17eacee015376606f871a4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:03:42,423 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:03:42,424 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:03:42,432 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:03:42,433 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:03:42,433 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:03:42,434 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:03:42,436 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:03:42,437 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:03:42,437 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:03:42,438 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:03:42,438 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:03:42,439 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:03:42,440 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:03:42,440 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:03:42,441 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:03:42,441 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:03:42,443 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:03:42,444 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:03:42,445 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:03:42,446 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:03:42,447 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:03:42,449 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:03:42,449 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:03:42,449 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:03:42,450 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:03:42,450 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:03:42,451 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:03:42,452 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:03:42,452 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:03:42,452 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:03:42,453 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:03:42,453 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:03:42,453 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:03:42,454 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:03:42,455 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:03:42,455 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7f8704b9-e07c-4a27-9154-b4f7ab0c6db5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 13:03:42,466 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:03:42,466 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:03:42,467 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:03:42,467 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:03:42,467 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:03:42,467 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 13:03:42,467 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 13:03:42,467 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 13:03:42,467 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 13:03:42,468 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 13:03:42,468 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 13:03:42,468 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:03:42,468 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:03:42,468 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:03:42,468 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:03:42,468 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 13:03:42,468 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 13:03:42,469 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 13:03:42,469 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:03:42,469 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 13:03:42,469 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:03:42,469 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 13:03:42,469 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:03:42,469 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:03:42,470 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 13:03:42,472 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:03:42,472 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:03:42,472 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 13:03:42,473 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 13:03:42,473 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_7f8704b9-e07c-4a27-9154-b4f7ab0c6db5/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 -> f7c8cd0f6441598a9b17eacee015376606f871a4 [2018-11-28 13:03:42,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:03:42,507 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:03:42,510 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:03:42,511 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:03:42,511 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:03:42,512 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7f8704b9-e07c-4a27-9154-b4f7ab0c6db5/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5_true-termination.c.i [2018-11-28 13:03:42,557 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7f8704b9-e07c-4a27-9154-b4f7ab0c6db5/bin-2019/uautomizer/data/f29c4dd18/441d6634aae94b9da97cdf622322605f/FLAG41088431c [2018-11-28 13:03:42,957 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:03:42,957 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7f8704b9-e07c-4a27-9154-b4f7ab0c6db5/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5_true-termination.c.i [2018-11-28 13:03:42,961 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7f8704b9-e07c-4a27-9154-b4f7ab0c6db5/bin-2019/uautomizer/data/f29c4dd18/441d6634aae94b9da97cdf622322605f/FLAG41088431c [2018-11-28 13:03:42,969 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7f8704b9-e07c-4a27-9154-b4f7ab0c6db5/bin-2019/uautomizer/data/f29c4dd18/441d6634aae94b9da97cdf622322605f [2018-11-28 13:03:42,971 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:03:42,971 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:03:42,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:03:42,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:03:42,974 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:03:42,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:03:42" (1/1) ... [2018-11-28 13:03:42,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1597794d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:42, skipping insertion in model container [2018-11-28 13:03:42,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:03:42" (1/1) ... [2018-11-28 13:03:42,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:03:42,991 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:03:43,089 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:03:43,098 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:03:43,109 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:03:43,119 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:03:43,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:43 WrapperNode [2018-11-28 13:03:43,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:03:43,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:03:43,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:03:43,119 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:03:43,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:43" (1/1) ... [2018-11-28 13:03:43,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:43" (1/1) ... [2018-11-28 13:03:43,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:03:43,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:03:43,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:03:43,148 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:03:43,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:43" (1/1) ... [2018-11-28 13:03:43,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:43" (1/1) ... [2018-11-28 13:03:43,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:43" (1/1) ... [2018-11-28 13:03:43,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:43" (1/1) ... [2018-11-28 13:03:43,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:43" (1/1) ... [2018-11-28 13:03:43,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:43" (1/1) ... [2018-11-28 13:03:43,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:43" (1/1) ... [2018-11-28 13:03:43,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:03:43,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:03:43,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:03:43,202 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:03:43,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f8704b9-e07c-4a27-9154-b4f7ab0c6db5/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-28 13:03:43,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:03:43,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:03:43,238 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-28 13:03:43,238 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-28 13:03:43,238 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-28 13:03:43,238 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-28 13:03:43,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:03:43,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:03:43,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:03:43,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:03:43,450 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:03:43,450 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-28 13:03:43,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:03:43 BoogieIcfgContainer [2018-11-28 13:03:43,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:03:43,451 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 13:03:43,451 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 13:03:43,454 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 13:03:43,455 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:03:43,455 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 01:03:42" (1/3) ... [2018-11-28 13:03:43,455 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1377a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:03:43, skipping insertion in model container [2018-11-28 13:03:43,456 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:03:43,456 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:43" (2/3) ... [2018-11-28 13:03:43,456 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1377a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:03:43, skipping insertion in model container [2018-11-28 13:03:43,456 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:03:43,456 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:03:43" (3/3) ... [2018-11-28 13:03:43,457 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex5_true-termination.c.i [2018-11-28 13:03:43,492 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:03:43,493 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 13:03:43,493 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 13:03:43,493 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 13:03:43,493 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:03:43,493 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:03:43,493 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 13:03:43,493 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:03:43,494 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 13:03:43,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-28 13:03:43,521 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 13:03:43,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:03:43,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:03:43,526 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 13:03:43,526 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:43,526 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 13:03:43,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-28 13:03:43,528 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 13:03:43,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:03:43,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:03:43,529 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 13:03:43,529 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:43,534 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 13#L63true assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 8#L63-2true assume !main_#t~short17;havoc main_#t~mem15;havoc main_#t~short17;havoc main_#t~mem16;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 21#L66true call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 18#fENTRYtrue [2018-11-28 13:03:43,534 INFO L796 eck$LassoCheckResult]: Loop: 18#fENTRYtrue ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 11#L17true assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 19#L25true call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 15#gENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 3#L34true assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 4#gFINALtrue assume true; 7#gEXITtrue >#37#return; 22#L25-1true call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 18#fENTRYtrue [2018-11-28 13:03:43,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:43,538 INFO L82 PathProgramCache]: Analyzing trace with hash 44919073, now seen corresponding path program 1 times [2018-11-28 13:03:43,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:43,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:43,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:43,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:43,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:43,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:43,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1513071857, now seen corresponding path program 1 times [2018-11-28 13:03:43,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:43,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:43,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:43,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:43,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:43,729 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-28 13:03:43,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:43,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:03:43,735 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:03:43,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:03:43,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:03:43,749 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 6 states. [2018-11-28 13:03:43,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:43,854 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-11-28 13:03:43,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:03:43,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2018-11-28 13:03:43,858 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 13:03:43,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 17 states and 20 transitions. [2018-11-28 13:03:43,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-28 13:03:43,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-28 13:03:43,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2018-11-28 13:03:43,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:03:43,865 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-28 13:03:43,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2018-11-28 13:03:43,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-28 13:03:43,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 13:03:43,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-28 13:03:43,884 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-28 13:03:43,885 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-28 13:03:43,885 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 13:03:43,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-28 13:03:43,885 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 13:03:43,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:03:43,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:03:43,886 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 13:03:43,886 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:43,886 INFO L794 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 72#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 73#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 67#L63-2 assume !main_#t~short17;havoc main_#t~mem15;havoc main_#t~short17;havoc main_#t~mem16;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 68#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 75#fENTRY [2018-11-28 13:03:43,886 INFO L796 eck$LassoCheckResult]: Loop: 75#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 70#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 61#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 65#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 60#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~post8;havoc #t~mem7; 62#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 65#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 60#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 63#gFINAL assume true; 64#gEXIT >#41#return; 66#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 69#gFINAL assume true; 76#gEXIT >#37#return; 71#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 75#fENTRY [2018-11-28 13:03:43,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:43,887 INFO L82 PathProgramCache]: Analyzing trace with hash 44919073, now seen corresponding path program 2 times [2018-11-28 13:03:43,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:43,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:43,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:43,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:43,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:43,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:43,905 INFO L82 PathProgramCache]: Analyzing trace with hash 916774883, now seen corresponding path program 1 times [2018-11-28 13:03:43,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:43,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:43,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:43,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:03:43,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:44,006 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-28 13:03:44,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:03:44,006 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f8704b9-e07c-4a27-9154-b4f7ab0c6db5/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-28 13:03:44,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:44,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:44,069 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 13 treesize of output 10 [2018-11-28 13:03:44,071 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 10 treesize of output 9 [2018-11-28 13:03:44,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:44,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:44,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:44,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-28 13:03:44,191 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-28 13:03:44,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:03:44,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-28 13:03:44,206 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:03:44,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 13:03:44,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:03:44,207 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 13 states. [2018-11-28 13:03:44,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:44,338 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-28 13:03:44,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:03:44,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-11-28 13:03:44,340 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 13:03:44,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2018-11-28 13:03:44,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 13:03:44,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 13:03:44,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-28 13:03:44,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:03:44,342 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 13:03:44,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-28 13:03:44,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-28 13:03:44,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 13:03:44,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-28 13:03:44,344 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 13:03:44,344 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 13:03:44,344 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 13:03:44,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-28 13:03:44,345 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 13:03:44,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:03:44,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:03:44,346 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 13:03:44,346 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:44,346 INFO L794 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 170#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 171#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 165#L63-2 assume !main_#t~short17;havoc main_#t~mem15;havoc main_#t~short17;havoc main_#t~mem16;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 166#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 173#fENTRY [2018-11-28 13:03:44,346 INFO L796 eck$LassoCheckResult]: Loop: 173#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 168#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 159#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 163#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 158#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~post8;havoc #t~mem7; 160#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 163#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 158#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~post8;havoc #t~mem7; 160#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 163#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 158#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 161#gFINAL assume true; 162#gEXIT >#41#return; 164#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 167#gFINAL assume true; 177#gEXIT >#41#return; 175#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 176#gFINAL assume true; 174#gEXIT >#37#return; 169#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 173#fENTRY [2018-11-28 13:03:44,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:44,347 INFO L82 PathProgramCache]: Analyzing trace with hash 44919073, now seen corresponding path program 3 times [2018-11-28 13:03:44,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:44,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:44,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:44,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:44,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:44,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:44,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1267451407, now seen corresponding path program 2 times [2018-11-28 13:03:44,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:44,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:44,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:44,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:03:44,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:44,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:44,400 INFO L82 PathProgramCache]: Analyzing trace with hash -2054594769, now seen corresponding path program 1 times [2018-11-28 13:03:44,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:44,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:44,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:44,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:03:44,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:44,753 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2018-11-28 13:03:45,071 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 107 [2018-11-28 13:03:45,507 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 120 [2018-11-28 13:03:45,780 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2018-11-28 13:03:45,916 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:03:45,917 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:03:45,917 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:03:45,917 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:03:45,917 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:03:45,917 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:03:45,917 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:03:45,918 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:03:45,918 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5_true-termination.c.i_Iteration3_Lasso [2018-11-28 13:03:45,918 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:03:45,918 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:03:45,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-28 13:03:45,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:45,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:45,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:45,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:45,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:45,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:45,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:45,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:45,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:45,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:45,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:46,222 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:03:46,225 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:03:46,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:46,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:46,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:46,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:46,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:46,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:46,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:46,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:46,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:46,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:46,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:46,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:46,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:46,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:46,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:46,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:46,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:46,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:46,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:46,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:46,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:46,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:46,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:46,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:46,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:46,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:46,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:46,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:46,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:46,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:46,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:46,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:46,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:46,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:46,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:46,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:46,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:46,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:46,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:46,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:46,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:46,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:46,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:46,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:46,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:46,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:46,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:46,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:46,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:46,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:46,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:46,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:46,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:46,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:46,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:46,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:46,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:46,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:46,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:46,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:46,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:46,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:46,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:46,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:46,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:46,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:46,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:46,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:46,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:46,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:46,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:46,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:46,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:46,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:46,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:46,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:46,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:46,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:03:46,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:46,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:46,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:46,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:46,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:46,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:46,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:46,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:46,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:46,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:46,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:46,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:46,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:46,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:46,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:46,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:46,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:46,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:46,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:46,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:46,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:46,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:46,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:46,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:46,255 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:03:46,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:46,255 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:03:46,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:46,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:46,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:46,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:46,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:46,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:46,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:46,259 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:03:46,259 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:46,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:46,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:46,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:46,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:46,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:46,266 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:03:46,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:46,266 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:03:46,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:46,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:46,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:46,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:46,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:46,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:46,268 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:03:46,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:46,269 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:03:46,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:46,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:46,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:46,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:46,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:46,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:46,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:46,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:03:46,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:46,278 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:03:46,281 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 13:03:46,282 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 13:03:46,284 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:03:46,285 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:03:46,285 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:03:46,285 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(f_#in~v) = 2*f_#in~v + 1 Supporting invariants [] [2018-11-28 13:03:46,294 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 13:03:46,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:46,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:46,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-28 13:03:46,381 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 13:03:46,381 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-28 13:03:46,442 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 63 states and 72 transitions. Complement of second has 15 states. [2018-11-28 13:03:46,444 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-28 13:03:46,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:03:46,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-28 13:03:46,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 20 letters. [2018-11-28 13:03:46,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:03:46,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 25 letters. Loop has 20 letters. [2018-11-28 13:03:46,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:03:46,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 40 letters. [2018-11-28 13:03:46,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:03:46,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 72 transitions. [2018-11-28 13:03:46,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 13:03:46,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 40 states and 47 transitions. [2018-11-28 13:03:46,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 13:03:46,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 13:03:46,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2018-11-28 13:03:46,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:03:46,454 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-11-28 13:03:46,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2018-11-28 13:03:46,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2018-11-28 13:03:46,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 13:03:46,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-11-28 13:03:46,457 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-28 13:03:46,457 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-28 13:03:46,457 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 13:03:46,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 34 transitions. [2018-11-28 13:03:46,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 13:03:46,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:03:46,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:03:46,458 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:46,458 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:03:46,459 INFO L794 eck$LassoCheckResult]: Stem: 377#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 375#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 376#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 368#L63-2 assume !main_#t~short17;havoc main_#t~mem15;havoc main_#t~short17;havoc main_#t~mem16;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 369#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 378#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 371#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 359#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 365#gENTRY [2018-11-28 13:03:46,459 INFO L796 eck$LassoCheckResult]: Loop: 365#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 357#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~post8;havoc #t~mem7; 358#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 365#gENTRY [2018-11-28 13:03:46,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:46,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1845692449, now seen corresponding path program 1 times [2018-11-28 13:03:46,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:46,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:46,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:46,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:46,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:46,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:46,477 INFO L82 PathProgramCache]: Analyzing trace with hash 38883, now seen corresponding path program 1 times [2018-11-28 13:03:46,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:46,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:46,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:46,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:46,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:46,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:46,483 INFO L82 PathProgramCache]: Analyzing trace with hash -852415675, now seen corresponding path program 1 times [2018-11-28 13:03:46,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:46,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:46,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:46,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:46,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:46,848 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2018-11-28 13:03:47,090 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 100 [2018-11-28 13:03:47,136 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:03:47,136 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:03:47,136 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:03:47,136 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:03:47,136 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:03:47,136 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:03:47,136 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:03:47,136 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:03:47,136 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5_true-termination.c.i_Iteration4_Lasso [2018-11-28 13:03:47,136 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:03:47,136 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:03:47,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:47,452 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:03:47,453 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:03:47,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:47,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:47,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:47,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:47,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:47,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:47,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:47,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:47,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:47,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:47,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:47,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:47,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:47,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:47,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:47,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:47,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:47,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:47,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:47,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:47,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:47,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:47,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:47,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:47,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:47,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:47,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:47,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:47,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:47,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:47,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:47,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:47,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:47,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:47,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:47,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:47,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:47,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:47,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:47,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:47,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:47,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:47,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:47,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:47,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:47,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:47,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:47,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:47,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:47,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:47,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:47,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:47,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:47,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:47,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:47,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:47,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:47,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:47,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:47,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:47,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:47,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:47,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:47,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:47,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:47,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:47,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:47,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:47,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:47,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:47,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:47,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:47,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:47,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:47,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:47,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:47,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:47,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:47,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:47,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:47,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:47,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:47,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:47,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:47,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:47,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:47,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:03:47,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:47,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:47,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:47,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:47,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:47,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:47,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:47,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:47,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:47,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:47,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:47,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:47,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:47,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:47,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:47,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:47,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:47,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:47,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:47,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:47,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:47,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:47,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:47,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:47,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:47,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:47,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:47,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:47,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:47,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:47,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:47,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:47,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:47,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:47,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:47,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:47,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:47,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:47,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:47,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:47,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:47,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:47,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:47,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:47,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:47,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:47,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:47,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:47,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:47,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:47,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:47,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:47,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:47,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:47,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:47,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:47,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:47,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:47,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:47,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:47,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:47,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:47,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:47,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:47,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:47,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:47,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:47,491 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:03:47,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:47,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:47,492 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:03:47,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:47,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:47,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:47,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:47,495 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:03:47,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:47,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:47,496 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:03:47,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:47,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:47,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:47,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:47,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:47,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:47,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:47,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:03:47,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:47,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:47,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:47,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:47,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:47,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:47,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:47,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:03:47,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:47,521 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:03:47,525 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 13:03:47,525 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 13:03:47,525 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:03:47,526 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:03:47,526 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:03:47,526 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_1) = 2*v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_1 + 1 Supporting invariants [] [2018-11-28 13:03:47,531 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 13:03:47,534 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 13:03:47,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:47,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:47,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:47,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:47,599 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-28 13:03:47,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:47,603 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-28 13:03:47,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:47,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:47,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:47,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-28 13:03:47,619 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-28 13:03:47,619 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-28 13:03:47,619 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 34 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-28 13:03:47,659 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 34 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 57 states and 66 transitions. Complement of second has 15 states. [2018-11-28 13:03:47,660 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-28 13:03:47,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 13:03:47,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-28 13:03:47,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-28 13:03:47,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:03:47,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-28 13:03:47,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:03:47,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-28 13:03:47,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:03:47,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 66 transitions. [2018-11-28 13:03:47,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 13:03:47,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 40 states and 48 transitions. [2018-11-28 13:03:47,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 13:03:47,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 13:03:47,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 48 transitions. [2018-11-28 13:03:47,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:03:47,663 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-28 13:03:47,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 48 transitions. [2018-11-28 13:03:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-28 13:03:47,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 13:03:47,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-28 13:03:47,665 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-28 13:03:47,665 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-28 13:03:47,665 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 13:03:47,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2018-11-28 13:03:47,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 13:03:47,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:03:47,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:03:47,667 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:47,667 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:03:47,667 INFO L794 eck$LassoCheckResult]: Stem: 539#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 537#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 538#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 531#L63-2 assume !main_#t~short17;havoc main_#t~mem15;havoc main_#t~short17;havoc main_#t~mem16;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 532#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 541#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 536#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 520#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 540#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 519#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~post8;havoc #t~mem7; 521#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 553#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 552#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~post8;havoc #t~mem7; 523#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 553#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 549#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 522#gFINAL assume true; 524#gEXIT >#41#return; 530#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 533#gFINAL assume true; 548#gEXIT >#41#return; 547#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 546#gFINAL assume true; 544#gEXIT >#37#return; 535#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 542#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 534#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 518#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 525#gENTRY [2018-11-28 13:03:47,667 INFO L796 eck$LassoCheckResult]: Loop: 525#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 516#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~post8;havoc #t~mem7; 517#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 525#gENTRY [2018-11-28 13:03:47,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:47,667 INFO L82 PathProgramCache]: Analyzing trace with hash -853827823, now seen corresponding path program 2 times [2018-11-28 13:03:47,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:47,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:47,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:47,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:47,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:47,786 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 13:03:47,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:03:47,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f8704b9-e07c-4a27-9154-b4f7ab0c6db5/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-28 13:03:47,794 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:03:47,827 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:03:47,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:03:47,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:47,834 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 13 treesize of output 10 [2018-11-28 13:03:47,836 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 10 treesize of output 9 [2018-11-28 13:03:47,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:47,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:47,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:47,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-28 13:03:47,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-28 13:03:47,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-28 13:03:47,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:47,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:47,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:47,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:3 [2018-11-28 13:03:47,930 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 13:03:47,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:03:47,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2018-11-28 13:03:47,945 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:03:47,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:47,945 INFO L82 PathProgramCache]: Analyzing trace with hash 38883, now seen corresponding path program 2 times [2018-11-28 13:03:47,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:47,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:47,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:47,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:03:47,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:48,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 13:03:48,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:03:48,026 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 12 Second operand 17 states. [2018-11-28 13:03:48,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:48,176 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2018-11-28 13:03:48,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:03:48,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2018-11-28 13:03:48,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 13:03:48,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 46 states and 58 transitions. [2018-11-28 13:03:48,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 13:03:48,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 13:03:48,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2018-11-28 13:03:48,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:03:48,179 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-11-28 13:03:48,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2018-11-28 13:03:48,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-11-28 13:03:48,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 13:03:48,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2018-11-28 13:03:48,182 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-28 13:03:48,183 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-28 13:03:48,183 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 13:03:48,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2018-11-28 13:03:48,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 13:03:48,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:03:48,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:03:48,184 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:48,184 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:03:48,184 INFO L794 eck$LassoCheckResult]: Stem: 743#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 741#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 742#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 734#L63-2 assume !main_#t~short17;havoc main_#t~mem15;havoc main_#t~short17;havoc main_#t~mem16;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 735#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 746#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 747#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 750#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 759#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 758#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~post8;havoc #t~mem7; 725#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 732#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 757#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~post8;havoc #t~mem7; 724#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 732#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 757#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~post8;havoc #t~mem7; 724#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 732#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 723#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 726#gFINAL assume true; 761#gEXIT >#41#return; 736#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 727#gFINAL assume true; 730#gEXIT >#41#return; 733#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 760#gFINAL assume true; 753#gEXIT >#41#return; 752#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 751#gFINAL assume true; 749#gEXIT >#37#return; 738#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 748#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 737#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 722#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 731#gENTRY [2018-11-28 13:03:48,184 INFO L796 eck$LassoCheckResult]: Loop: 731#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 720#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~post8;havoc #t~mem7; 721#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 731#gENTRY [2018-11-28 13:03:48,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:48,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1079381827, now seen corresponding path program 3 times [2018-11-28 13:03:48,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:48,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:48,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:48,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:03:48,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:48,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:48,218 INFO L82 PathProgramCache]: Analyzing trace with hash 38883, now seen corresponding path program 3 times [2018-11-28 13:03:48,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:48,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:48,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:48,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:03:48,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:48,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:48,223 INFO L82 PathProgramCache]: Analyzing trace with hash 556146087, now seen corresponding path program 4 times [2018-11-28 13:03:48,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:48,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:48,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:48,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:03:48,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:48,559 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2018-11-28 13:03:48,835 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 107 [2018-11-28 13:03:49,140 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 115 [2018-11-28 13:03:49,619 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 128 [2018-11-28 13:03:49,906 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 117 [2018-11-28 13:03:50,085 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2018-11-28 13:03:50,637 WARN L180 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 144 [2018-11-28 13:03:50,793 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2018-11-28 13:03:50,796 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:03:50,796 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:03:50,796 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:03:50,796 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:03:50,796 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:03:50,796 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:03:50,796 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:03:50,796 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:03:50,796 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5_true-termination.c.i_Iteration6_Lasso [2018-11-28 13:03:50,796 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:03:50,796 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:03:50,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-28 13:03:50,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-28 13:03:50,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-28 13:03:50,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-28 13:03:50,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:50,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:51,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:51,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:51,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:51,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:51,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:51,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:51,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:51,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:51,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:51,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:51,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:51,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:51,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:51,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:51,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:51,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:51,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:51,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:51,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:51,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:51,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:51,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:51,222 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:03:51,223 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:03:51,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:51,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:51,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:51,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:51,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:51,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:51,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:51,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:51,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:51,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:51,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:51,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:51,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:51,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:51,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:51,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:51,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:51,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:51,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:51,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:51,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:51,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:51,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:51,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:51,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:51,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:51,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:51,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:51,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:51,228 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:03:51,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:51,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:51,228 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:03:51,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:51,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:51,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:51,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:51,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:51,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:51,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:51,231 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:03:51,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:51,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:51,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 13:03:51,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:51,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:51,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:51,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:51,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:03:51,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:51,249 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:03:51,255 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 13:03:51,255 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 13:03:51,255 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:03:51,256 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:03:51,256 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:03:51,256 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_2) = 2*v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_2 + 1 Supporting invariants [] [2018-11-28 13:03:51,268 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-28 13:03:51,269 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 13:03:51,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:51,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:51,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:51,366 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:51,366 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-28 13:03:51,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:51,369 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-28 13:03:51,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:51,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:51,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:51,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-28 13:03:51,383 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-28 13:03:51,383 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-28 13:03:51,383 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-28 13:03:51,428 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 15 states. [2018-11-28 13:03:51,430 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-28 13:03:51,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:03:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-11-28 13:03:51,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 34 letters. Loop has 3 letters. [2018-11-28 13:03:51,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:03:51,431 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:03:51,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:51,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:51,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:51,515 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:51,516 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-28 13:03:51,518 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:51,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-28 13:03:51,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:51,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:51,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:51,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-28 13:03:51,534 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-28 13:03:51,535 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-28 13:03:51,535 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-28 13:03:51,591 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 15 states. [2018-11-28 13:03:51,594 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-28 13:03:51,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:03:51,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-11-28 13:03:51,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 34 letters. Loop has 3 letters. [2018-11-28 13:03:51,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:03:51,594 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:03:51,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:51,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:51,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:51,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:51,683 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-28 13:03:51,686 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:51,687 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-28 13:03:51,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:51,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:51,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:51,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-28 13:03:51,707 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-28 13:03:51,707 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-28 13:03:51,707 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-28 13:03:51,774 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 64 states and 73 transitions. Complement of second has 15 states. [2018-11-28 13:03:51,775 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-28 13:03:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:03:51,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2018-11-28 13:03:51,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 34 letters. Loop has 3 letters. [2018-11-28 13:03:51,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:03:51,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 37 letters. Loop has 3 letters. [2018-11-28 13:03:51,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:03:51,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 34 letters. Loop has 6 letters. [2018-11-28 13:03:51,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:03:51,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 73 transitions. [2018-11-28 13:03:51,778 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:03:51,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2018-11-28 13:03:51,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 13:03:51,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 13:03:51,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 13:03:51,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:03:51,779 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:03:51,779 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:03:51,779 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:03:51,779 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 13:03:51,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:03:51,779 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:03:51,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 13:03:51,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 01:03:51 BoogieIcfgContainer [2018-11-28 13:03:51,784 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 13:03:51,785 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:03:51,785 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:03:51,785 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:03:51,785 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:03:43" (3/4) ... [2018-11-28 13:03:51,788 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 13:03:51,788 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:03:51,789 INFO L168 Benchmark]: Toolchain (without parser) took 8817.51 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 356.0 MB). Free memory was 953.3 MB in the beginning and 926.7 MB in the end (delta: 26.6 MB). Peak memory consumption was 382.6 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:51,789 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:03:51,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.19 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:51,790 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.35 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:51,790 INFO L168 Benchmark]: Boogie Preprocessor took 53.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:51,791 INFO L168 Benchmark]: RCFGBuilder took 248.96 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:51,791 INFO L168 Benchmark]: BuchiAutomizer took 8333.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.6 MB). Free memory was 1.1 GB in the beginning and 926.7 MB in the end (delta: 176.3 MB). Peak memory consumption was 405.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:51,791 INFO L168 Benchmark]: Witness Printer took 3.24 ms. Allocated memory is still 1.4 GB. Free memory is still 926.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:03:51,794 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 147.19 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.35 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 248.96 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8333.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.6 MB). Free memory was 1.1 GB in the beginning and 926.7 MB in the end (delta: 176.3 MB). Peak memory consumption was 405.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.24 ms. Allocated memory is still 1.4 GB. Free memory is still 926.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * \old(v) + 1 and consists of 5 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. 3 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.3s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 6.9s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 43 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 14/14 HoareTripleCheckerStatistics: 116 SDtfs, 91 SDslu, 217 SDs, 0 SdLazy, 340 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital339 mio100 ax100 hnf100 lsp97 ukn35 mio100 lsp24 div100 bol100 ite100 ukn100 eq199 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 1 VariablesLoop: 0 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...