./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrstr-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_794b6d5b-9264-41ac-8fa2-b5bce02aaefd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_794b6d5b-9264-41ac-8fa2-b5bce02aaefd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_794b6d5b-9264-41ac-8fa2-b5bce02aaefd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_794b6d5b-9264-41ac-8fa2-b5bce02aaefd/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrstr-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_794b6d5b-9264-41ac-8fa2-b5bce02aaefd/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_794b6d5b-9264-41ac-8fa2-b5bce02aaefd/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 a1e56cd09ec23c2fd76dcb47b6d93a02131ca6ec .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 12:58:28,272 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:58:28,273 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:58:28,281 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:58:28,282 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:58:28,282 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:58:28,283 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:58:28,284 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:58:28,285 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:58:28,286 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:58:28,287 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:58:28,287 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:58:28,287 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:58:28,288 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:58:28,289 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:58:28,289 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:58:28,290 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:58:28,291 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:58:28,292 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:58:28,293 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:58:28,294 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:58:28,295 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:58:28,296 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:58:28,296 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:58:28,296 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:58:28,297 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:58:28,298 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:58:28,298 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:58:28,299 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:58:28,300 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:58:28,300 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:58:28,300 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:58:28,300 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:58:28,301 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:58:28,301 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:58:28,302 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:58:28,302 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_794b6d5b-9264-41ac-8fa2-b5bce02aaefd/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 12:58:28,312 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:58:28,312 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:58:28,313 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:58:28,313 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:58:28,313 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:58:28,313 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 12:58:28,314 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 12:58:28,314 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 12:58:28,314 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 12:58:28,314 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 12:58:28,314 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 12:58:28,314 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:58:28,314 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 12:58:28,314 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:58:28,315 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:58:28,315 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 12:58:28,315 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 12:58:28,315 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 12:58:28,315 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:58:28,315 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 12:58:28,315 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:58:28,315 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 12:58:28,316 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:58:28,316 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:58:28,316 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 12:58:28,316 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:58:28,316 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:58:28,316 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 12:58:28,317 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 12:58:28,317 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_794b6d5b-9264-41ac-8fa2-b5bce02aaefd/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 -> a1e56cd09ec23c2fd76dcb47b6d93a02131ca6ec [2018-11-23 12:58:28,343 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:58:28,352 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:58:28,355 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:58:28,356 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:58:28,357 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:58:28,357 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_794b6d5b-9264-41ac-8fa2-b5bce02aaefd/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrstr-alloca_true-termination.c.i [2018-11-23 12:58:28,395 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_794b6d5b-9264-41ac-8fa2-b5bce02aaefd/bin-2019/uautomizer/data/395ffb923/fdd51e8e2f7c43c5a262620f64744f5f/FLAGb8e1125eb [2018-11-23 12:58:28,826 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:58:28,827 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_794b6d5b-9264-41ac-8fa2-b5bce02aaefd/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrstr-alloca_true-termination.c.i [2018-11-23 12:58:28,835 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_794b6d5b-9264-41ac-8fa2-b5bce02aaefd/bin-2019/uautomizer/data/395ffb923/fdd51e8e2f7c43c5a262620f64744f5f/FLAGb8e1125eb [2018-11-23 12:58:28,843 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_794b6d5b-9264-41ac-8fa2-b5bce02aaefd/bin-2019/uautomizer/data/395ffb923/fdd51e8e2f7c43c5a262620f64744f5f [2018-11-23 12:58:28,845 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:58:28,846 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:58:28,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:58:28,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:58:28,848 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:58:28,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:58:28" (1/1) ... [2018-11-23 12:58:28,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d97fd37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:28, skipping insertion in model container [2018-11-23 12:58:28,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:58:28" (1/1) ... [2018-11-23 12:58:28,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:58:28,884 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:58:29,072 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:58:29,079 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:58:29,146 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:58:29,172 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:58:29,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:29 WrapperNode [2018-11-23 12:58:29,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:58:29,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:58:29,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:58:29,173 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:58:29,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:29" (1/1) ... [2018-11-23 12:58:29,187 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:29" (1/1) ... [2018-11-23 12:58:29,203 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:58:29,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:58:29,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:58:29,203 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:58:29,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:29" (1/1) ... [2018-11-23 12:58:29,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:29" (1/1) ... [2018-11-23 12:58:29,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:29" (1/1) ... [2018-11-23 12:58:29,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:29" (1/1) ... [2018-11-23 12:58:29,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:29" (1/1) ... [2018-11-23 12:58:29,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:29" (1/1) ... [2018-11-23 12:58:29,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:29" (1/1) ... [2018-11-23 12:58:29,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:58:29,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:58:29,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:58:29,228 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:58:29,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_794b6d5b-9264-41ac-8fa2-b5bce02aaefd/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:58:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:58:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:58:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:58:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:58:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:58:29,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:58:29,530 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:58:29,530 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-23 12:58:29,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:58:29 BoogieIcfgContainer [2018-11-23 12:58:29,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:58:29,531 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 12:58:29,531 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 12:58:29,533 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 12:58:29,534 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:58:29,534 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 12:58:28" (1/3) ... [2018-11-23 12:58:29,535 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ccffc6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:58:29, skipping insertion in model container [2018-11-23 12:58:29,535 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:58:29,535 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:29" (2/3) ... [2018-11-23 12:58:29,535 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ccffc6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:58:29, skipping insertion in model container [2018-11-23 12:58:29,535 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:58:29,536 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:58:29" (3/3) ... [2018-11-23 12:58:29,537 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-termination.c.i [2018-11-23 12:58:29,580 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:58:29,580 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 12:58:29,581 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 12:58:29,581 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 12:58:29,581 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:58:29,581 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:58:29,581 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 12:58:29,581 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:58:29,581 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 12:58:29,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-23 12:58:29,606 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-23 12:58:29,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:58:29,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:58:29,611 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 12:58:29,611 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 12:58:29,611 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 12:58:29,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-23 12:58:29,613 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-23 12:58:29,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:58:29,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:58:29,614 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 12:58:29,614 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 12:58:29,619 INFO L794 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 3#L588true assume !(main_~length1~0 < 1); 6#L588-2true assume !(main_~length2~0 < 1); 15#L591-1true call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 27#L573true assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 18#L551-4true [2018-11-23 12:58:29,619 INFO L796 eck$LassoCheckResult]: Loop: 18#L551-4true call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 29#L551-1true assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 14#L551-3true cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 18#L551-4true [2018-11-23 12:58:29,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:29,623 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2018-11-23 12:58:29,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:29,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:29,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:29,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:29,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:29,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:29,722 INFO L82 PathProgramCache]: Analyzing trace with hash 51799, now seen corresponding path program 1 times [2018-11-23 12:58:29,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:29,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:29,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:29,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:29,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:29,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:29,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1298288364, now seen corresponding path program 1 times [2018-11-23 12:58:29,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:29,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:29,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:29,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:29,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:30,106 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2018-11-23 12:58:30,216 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 12:58:30,217 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 12:58:30,218 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 12:58:30,218 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 12:58:30,218 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 12:58:30,218 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:58:30,218 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 12:58:30,218 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 12:58:30,219 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-23 12:58:30,219 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 12:58:30,219 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 12:58:30,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-23 12:58:30,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:30,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:30,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:30,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:30,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:30,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:30,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:30,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:30,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:30,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:30,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-23 12:58:30,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:30,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:30,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:30,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:30,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-23 12:58:30,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-23 12:58:30,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-23 12:58:30,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-23 12:58:30,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:30,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:30,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-23 12:58:30,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:30,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:30,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:30,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:30,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:30,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:30,520 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2018-11-23 12:58:30,911 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 12:58:30,915 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 12:58:30,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:30,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:30,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:30,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:30,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:30,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:30,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:30,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:30,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:30,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:30,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:30,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:30,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:30,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:30,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:30,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:30,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:30,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:30,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:30,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:30,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:30,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:30,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:30,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:30,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:30,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:30,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:30,952 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:30,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:30,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:30,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:30,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:30,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:30,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:30,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:30,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:30,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:30,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:30,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:30,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:30,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:30,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:30,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:30,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:30,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:30,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:30,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:30,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:30,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:30,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:30,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:30,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:30,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:30,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:30,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:30,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:30,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:30,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:30,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:30,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:30,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:30,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:30,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:30,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:30,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:30,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:30,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:30,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:30,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:30,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:30,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:30,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:30,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:30,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:30,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:30,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:30,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:30,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:30,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:30,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:30,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:30,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:31,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:31,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:31,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:31,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:31,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:31,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:31,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:31,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:31,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:31,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:31,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:31,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:31,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:31,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:31,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:31,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:31,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:31,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:31,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:31,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:31,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:31,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:31,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:31,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:31,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:31,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:31,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:31,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:31,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:31,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:31,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:31,027 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:31,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:31,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:31,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:31,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:31,030 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:58:31,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:31,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:31,032 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:58:31,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:31,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:31,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:31,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:31,039 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:58:31,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:31,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:31,041 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:58:31,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:31,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:31,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:31,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:31,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:31,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:31,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:31,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:31,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:31,082 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 12:58:31,114 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 12:58:31,114 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 12:58:31,116 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 12:58:31,117 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 12:58:31,118 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 12:58:31,118 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_1, ULTIMATE.start_cstrlen_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_1 - 1*ULTIMATE.start_cstrlen_~s~0.offset Supporting invariants [] [2018-11-23 12:58:31,158 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-23 12:58:31,166 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 12:58:31,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:31,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:58:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:31,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:58:31,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:58:31,245 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 12:58:31,246 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 4 states. [2018-11-23 12:58:31,314 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states.. Second operand 4 states. Result 80 states and 111 transitions. Complement of second has 7 states. [2018-11-23 12:58:31,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 12:58:31,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:58:31,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2018-11-23 12:58:31,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-23 12:58:31,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:58:31,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-23 12:58:31,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:58:31,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-23 12:58:31,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:58:31,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 111 transitions. [2018-11-23 12:58:31,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-23 12:58:31,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 27 states and 36 transitions. [2018-11-23 12:58:31,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 12:58:31,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-23 12:58:31,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2018-11-23 12:58:31,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 12:58:31,327 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-23 12:58:31,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2018-11-23 12:58:31,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 12:58:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:58:31,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2018-11-23 12:58:31,343 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-23 12:58:31,343 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-23 12:58:31,343 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 12:58:31,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2018-11-23 12:58:31,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-23 12:58:31,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:58:31,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:58:31,345 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:58:31,345 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:58:31,345 INFO L794 eck$LassoCheckResult]: Stem: 257#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 238#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 231#L588 assume !(main_~length1~0 < 1); 232#L588-2 assume !(main_~length2~0 < 1); 237#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 248#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 250#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 252#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 253#L551-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 254#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 256#L575-4 [2018-11-23 12:58:31,345 INFO L796 eck$LassoCheckResult]: Loop: 256#L575-4 goto; 239#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 233#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 234#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 255#L575-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 246#L558 assume 0 == cstrncmp_~n % 4294967296;cstrncmp_#res := 0; 235#L566 cstrstr_#t~ret16 := cstrncmp_#res; 236#L575-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 256#L575-4 [2018-11-23 12:58:31,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:31,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231857, now seen corresponding path program 1 times [2018-11-23 12:58:31,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:31,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:31,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:31,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:31,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:31,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:31,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1752516368, now seen corresponding path program 1 times [2018-11-23 12:58:31,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:31,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:31,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:31,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:31,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:58:31,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:58:31,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:58:31,416 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 12:58:31,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:58:31,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:58:31,419 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 12:58:31,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:31,442 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2018-11-23 12:58:31,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:58:31,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2018-11-23 12:58:31,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-23 12:58:31,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 32 transitions. [2018-11-23 12:58:31,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 12:58:31,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 12:58:31,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2018-11-23 12:58:31,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 12:58:31,446 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-23 12:58:31,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2018-11-23 12:58:31,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 12:58:31,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:58:31,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-11-23 12:58:31,447 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-23 12:58:31,447 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-23 12:58:31,447 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 12:58:31,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2018-11-23 12:58:31,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-23 12:58:31,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:58:31,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:58:31,449 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:58:31,449 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:58:31,449 INFO L794 eck$LassoCheckResult]: Stem: 319#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 317#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 308#L588 assume !(main_~length1~0 < 1); 309#L588-2 assume !(main_~length2~0 < 1); 298#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 299#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 303#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 305#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 306#L551-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 307#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 318#L575-4 [2018-11-23 12:58:31,449 INFO L796 eck$LassoCheckResult]: Loop: 318#L575-4 goto; 316#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 311#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 312#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 315#L575-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 300#L558 assume !(0 == cstrncmp_~n % 4294967296); 301#L560-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 310#L561 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;call cstrncmp_#t~mem9 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;call cstrncmp_#t~mem10 := read~int(cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, 1);cstrncmp_#res := cstrncmp_#t~mem9 % 256 - cstrncmp_#t~mem10 % 256;havoc cstrncmp_#t~mem9;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset;havoc cstrncmp_#t~mem10; 313#L566 cstrstr_#t~ret16 := cstrncmp_#res; 314#L575-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 318#L575-4 [2018-11-23 12:58:31,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:31,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231857, now seen corresponding path program 2 times [2018-11-23 12:58:31,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:31,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:31,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:31,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:31,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:31,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:31,468 INFO L82 PathProgramCache]: Analyzing trace with hash 542190293, now seen corresponding path program 1 times [2018-11-23 12:58:31,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:31,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:31,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:31,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:58:31,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:31,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:31,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1106695813, now seen corresponding path program 1 times [2018-11-23 12:58:31,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:31,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:31,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:31,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:31,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:58:31,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:58:31,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:58:31,759 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2018-11-23 12:58:31,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:58:31,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:58:31,798 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-23 12:58:31,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:31,853 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-11-23 12:58:31,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:58:31,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2018-11-23 12:58:31,856 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-23 12:58:31,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 41 transitions. [2018-11-23 12:58:31,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-23 12:58:31,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-23 12:58:31,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2018-11-23 12:58:31,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 12:58:31,858 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-23 12:58:31,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2018-11-23 12:58:31,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 12:58:31,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:58:31,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-23 12:58:31,860 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 12:58:31,860 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 12:58:31,860 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 12:58:31,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2018-11-23 12:58:31,863 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-23 12:58:31,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:58:31,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:58:31,863 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:58:31,863 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 12:58:31,863 INFO L794 eck$LassoCheckResult]: Stem: 401#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 397#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 389#L588 assume !(main_~length1~0 < 1); 390#L588-2 assume !(main_~length2~0 < 1); 378#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 379#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 383#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 385#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 387#L551-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 388#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 404#L575-4 goto; 396#L576-2 [2018-11-23 12:58:31,863 INFO L796 eck$LassoCheckResult]: Loop: 396#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 392#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 393#L576 assume !!(cstrstr_~sc~0 != cstrstr_~c~0); 396#L576-2 [2018-11-23 12:58:31,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:31,864 INFO L82 PathProgramCache]: Analyzing trace with hash 2114547350, now seen corresponding path program 1 times [2018-11-23 12:58:31,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:31,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:31,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:31,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:31,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:31,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:31,884 INFO L82 PathProgramCache]: Analyzing trace with hash 71663, now seen corresponding path program 1 times [2018-11-23 12:58:31,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:31,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:31,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:31,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:31,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:31,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:31,890 INFO L82 PathProgramCache]: Analyzing trace with hash 194815290, now seen corresponding path program 1 times [2018-11-23 12:58:31,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:31,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:31,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:31,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:31,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:32,180 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 123 [2018-11-23 12:58:32,439 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2018-11-23 12:58:32,441 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 12:58:32,441 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 12:58:32,441 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 12:58:32,441 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 12:58:32,441 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 12:58:32,441 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:58:32,442 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 12:58:32,442 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 12:58:32,442 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-23 12:58:32,442 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 12:58:32,442 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 12:58:32,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,685 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2018-11-23 12:58:32,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:32,918 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2018-11-23 12:58:33,177 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 12:58:33,177 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 12:58:33,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:33,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:33,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:33,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:33,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:33,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:33,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:33,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:33,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:33,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:33,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:33,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:33,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:33,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:33,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:33,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:33,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:33,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:33,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:33,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:33,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:33,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:33,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:33,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:33,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:33,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:33,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:33,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:33,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:33,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:33,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:33,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:33,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:33,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:33,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:33,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:33,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:33,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:33,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:33,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:33,211 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 12:58:33,226 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 12:58:33,226 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 12:58:33,226 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 12:58:33,227 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 12:58:33,227 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 12:58:33,227 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrstr_~s.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_2) = -1*ULTIMATE.start_cstrstr_~s.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_2 Supporting invariants [] [2018-11-23 12:58:33,287 INFO L297 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2018-11-23 12:58:33,289 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 12:58:33,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:33,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:58:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:33,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:58:33,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:58:33,338 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 12:58:33,339 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-23 12:58:33,372 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 50 states and 58 transitions. Complement of second has 5 states. [2018-11-23 12:58:33,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 12:58:33,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:58:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-11-23 12:58:33,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-23 12:58:33,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:58:33,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 12:58:33,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:58:33,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-23 12:58:33,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:58:33,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2018-11-23 12:58:33,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 12:58:33,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 36 states and 42 transitions. [2018-11-23 12:58:33,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-23 12:58:33,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 12:58:33,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2018-11-23 12:58:33,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 12:58:33,377 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-23 12:58:33,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2018-11-23 12:58:33,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 12:58:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:58:33,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-23 12:58:33,379 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-23 12:58:33,379 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-23 12:58:33,379 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 12:58:33,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2018-11-23 12:58:33,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 12:58:33,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:58:33,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:58:33,383 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:58:33,383 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 12:58:33,383 INFO L794 eck$LassoCheckResult]: Stem: 650#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 643#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 633#L588 assume !(main_~length1~0 < 1); 634#L588-2 assume !(main_~length2~0 < 1); 624#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 625#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 626#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 627#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 616#L551-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 617#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 628#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 629#L551-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 630#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 644#L575-4 goto; 645#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 635#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 637#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 640#L575-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 618#L558 assume !(0 == cstrncmp_~n % 4294967296); 619#L560-4 [2018-11-23 12:58:33,383 INFO L796 eck$LassoCheckResult]: Loop: 619#L560-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 631#L561 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 646#L563 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset;havoc cstrncmp_#t~mem12; 647#L560-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 622#L560-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 619#L560-4 [2018-11-23 12:58:33,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:33,383 INFO L82 PathProgramCache]: Analyzing trace with hash -912258627, now seen corresponding path program 1 times [2018-11-23 12:58:33,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:33,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:33,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:33,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:33,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:33,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:33,411 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 1 times [2018-11-23 12:58:33,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:33,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:33,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:33,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:33,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:33,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:33,421 INFO L82 PathProgramCache]: Analyzing trace with hash -599457521, now seen corresponding path program 1 times [2018-11-23 12:58:33,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:33,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:33,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:33,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:33,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:58:33,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:58:33,545 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_794b6d5b-9264-41ac-8fa2-b5bce02aaefd/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:58:33,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:33,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:58:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:58:33,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:58:33,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-11-23 12:58:33,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:58:33,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:58:33,818 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 9 Second operand 12 states. [2018-11-23 12:58:33,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:33,923 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-11-23 12:58:33,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:58:33,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 83 transitions. [2018-11-23 12:58:33,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 12:58:33,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 41 states and 47 transitions. [2018-11-23 12:58:33,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 12:58:33,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 12:58:33,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2018-11-23 12:58:33,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 12:58:33,925 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-23 12:58:33,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2018-11-23 12:58:33,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-23 12:58:33,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:58:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-11-23 12:58:33,927 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-11-23 12:58:33,928 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-11-23 12:58:33,928 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 12:58:33,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2018-11-23 12:58:33,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 12:58:33,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:58:33,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:58:33,929 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:58:33,929 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 12:58:33,929 INFO L794 eck$LassoCheckResult]: Stem: 849#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 846#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 836#L588 assume !(main_~length1~0 < 1); 837#L588-2 assume !(main_~length2~0 < 1); 825#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 826#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 829#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 830#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 819#L551-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 820#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 831#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 856#L551-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 857#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 855#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 832#L551-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 833#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 847#L575-4 goto; 848#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 838#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 840#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 843#L575-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 821#L558 assume !(0 == cstrncmp_~n % 4294967296); 822#L560-4 [2018-11-23 12:58:33,929 INFO L796 eck$LassoCheckResult]: Loop: 822#L560-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 834#L561 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 850#L563 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset;havoc cstrncmp_#t~mem12; 851#L560-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 827#L560-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 822#L560-4 [2018-11-23 12:58:33,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:33,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1478230621, now seen corresponding path program 2 times [2018-11-23 12:58:33,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:33,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:33,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:33,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:33,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:33,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:33,951 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 2 times [2018-11-23 12:58:33,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:33,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:33,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:33,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:58:33,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:33,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:33,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1703636079, now seen corresponding path program 2 times [2018-11-23 12:58:33,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:33,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:33,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:33,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:58:33,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:34,617 WARN L180 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 181 [2018-11-23 12:58:35,041 WARN L180 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 141 [2018-11-23 12:58:35,042 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 12:58:35,043 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 12:58:35,043 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 12:58:35,043 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 12:58:35,043 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 12:58:35,043 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:58:35,043 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 12:58:35,043 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 12:58:35,043 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-23 12:58:35,043 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 12:58:35,043 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 12:58:35,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,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-23 12:58:35,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,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-23 12:58:35,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,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-23 12:58:35,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-23 12:58:35,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-23 12:58:35,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-23 12:58:35,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-23 12:58:35,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-23 12:58:35,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-23 12:58:35,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-23 12:58:35,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,581 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 132 [2018-11-23 12:58:35,729 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2018-11-23 12:58:35,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:35,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:36,023 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2018-11-23 12:58:36,127 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2018-11-23 12:58:36,464 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 12:58:36,464 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 12:58:36,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,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-23 12:58:36,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:36,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:36,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,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-23 12:58:36,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:36,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:36,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:36,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:36,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:36,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:36,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:36,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:36,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:36,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:36,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:36,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,534 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:58:36,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,535 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:58:36,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:36,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,537 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:58:36,537 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 12:58:36,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,539 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 12:58:36,540 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 12:58:36,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:36,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:36,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,553 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:58:36,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,554 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:58:36,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:36,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,563 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:58:36,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,564 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:58:36,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:36,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:36,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:36,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:36,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:36,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:36,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:36,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:36,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:36,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:36,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:36,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:36,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:36,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:36,582 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:36,634 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 12:58:36,680 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 12:58:36,680 INFO L444 ModelExtractionUtils]: 78 out of 85 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 12:58:36,681 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 12:58:36,681 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 12:58:36,681 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 12:58:36,682 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_3) = -1*ULTIMATE.start_cstrncmp_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_3 Supporting invariants [] [2018-11-23 12:58:36,846 INFO L297 tatePredicateManager]: 50 out of 53 supporting invariants were superfluous and have been removed [2018-11-23 12:58:36,849 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 12:58:36,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:36,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:58:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:36,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:58:36,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:58:36,970 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2018-11-23 12:58:36,970 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-11-23 12:58:37,065 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9. Second operand 8 states. Result 97 states and 112 transitions. Complement of second has 12 states. [2018-11-23 12:58:37,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-23 12:58:37,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:58:37,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2018-11-23 12:58:37,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 42 transitions. Stem has 22 letters. Loop has 5 letters. [2018-11-23 12:58:37,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:58:37,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 42 transitions. Stem has 27 letters. Loop has 5 letters. [2018-11-23 12:58:37,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:58:37,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 42 transitions. Stem has 22 letters. Loop has 10 letters. [2018-11-23 12:58:37,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:58:37,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 112 transitions. [2018-11-23 12:58:37,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 12:58:37,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 74 states and 87 transitions. [2018-11-23 12:58:37,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-23 12:58:37,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-23 12:58:37,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 87 transitions. [2018-11-23 12:58:37,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 12:58:37,067 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 87 transitions. [2018-11-23 12:58:37,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 87 transitions. [2018-11-23 12:58:37,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 53. [2018-11-23 12:58:37,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:58:37,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2018-11-23 12:58:37,069 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2018-11-23 12:58:37,069 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2018-11-23 12:58:37,069 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 12:58:37,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 62 transitions. [2018-11-23 12:58:37,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 12:58:37,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:58:37,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:58:37,070 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:58:37,070 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 12:58:37,070 INFO L794 eck$LassoCheckResult]: Stem: 1329#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1325#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 1315#L588 assume !(main_~length1~0 < 1); 1316#L588-2 assume !(main_~length2~0 < 1); 1305#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 1306#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 1307#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1308#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1337#L551-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 1309#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1310#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1296#L551-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 1297#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1336#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1311#L551-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 1312#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 1326#L575-4 goto; 1327#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1328#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 1348#L576 assume !!(cstrstr_~sc~0 != cstrstr_~c~0); 1324#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1317#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 1319#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1322#L575-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 1302#L558 assume !(0 == cstrncmp_~n % 4294967296); 1299#L560-4 [2018-11-23 12:58:37,070 INFO L796 eck$LassoCheckResult]: Loop: 1299#L560-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 1313#L561 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 1330#L563 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset;havoc cstrncmp_#t~mem12; 1331#L560-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 1298#L560-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 1299#L560-4 [2018-11-23 12:58:37,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:37,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1711753785, now seen corresponding path program 1 times [2018-11-23 12:58:37,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:37,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:37,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:37,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:58:37,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:37,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:37,091 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 3 times [2018-11-23 12:58:37,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:37,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:37,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:37,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:37,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:37,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:37,100 INFO L82 PathProgramCache]: Analyzing trace with hash -234967533, now seen corresponding path program 1 times [2018-11-23 12:58:37,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:37,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:37,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:37,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:58:37,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:37,287 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2018-11-23 12:58:37,948 WARN L180 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 201 [2018-11-23 12:58:38,368 WARN L180 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 150 [2018-11-23 12:58:38,370 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 12:58:38,370 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 12:58:38,370 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 12:58:38,370 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 12:58:38,370 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 12:58:38,370 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:58:38,370 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 12:58:38,370 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 12:58:38,370 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-23 12:58:38,370 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 12:58:38,370 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 12:58:38,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:38,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:38,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:38,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:38,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:38,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:38,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:38,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:38,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:38,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:38,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:38,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:38,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:38,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:38,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:38,957 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 137 [2018-11-23 12:58:39,125 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 86 [2018-11-23 12:58:39,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:39,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:39,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:39,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:39,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:39,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:39,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:39,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:39,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:39,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:39,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:39,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:39,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:39,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-23 12:58:39,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-23 12:58:39,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-23 12:58:39,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-23 12:58:39,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:39,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-23 12:58:39,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-23 12:58:39,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-23 12:58:39,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-23 12:58:39,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:39,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-23 12:58:39,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-23 12:58:39,396 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2018-11-23 12:58:39,518 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2018-11-23 12:58:39,741 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-23 12:58:39,966 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 12:58:39,966 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 12:58:39,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:39,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:39,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:39,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:39,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:39,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:39,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:39,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:39,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:39,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:39,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:39,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:39,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:39,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:39,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:39,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:39,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:39,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:39,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:39,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:39,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:39,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:39,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:39,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:39,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:39,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:39,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:39,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:39,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:39,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:39,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:39,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:39,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:39,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:39,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:39,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:39,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:39,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:39,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:39,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:39,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:39,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:39,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:39,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:39,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:39,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:39,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:39,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:39,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:39,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:39,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:39,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:39,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:39,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:39,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:39,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:39,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:39,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:39,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:39,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:39,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:39,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:39,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:39,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:39,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:39,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:39,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:39,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:39,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:39,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:39,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:39,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:39,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:39,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:39,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:39,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:39,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:39,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:39,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:39,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:39,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:39,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:39,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:39,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:39,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:39,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:39,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:39,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:39,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:39,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:39,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:39,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:39,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:39,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:39,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:39,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:39,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:39,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:39,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:39,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:39,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:39,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:39,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:39,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:39,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:39,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:39,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:39,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:39,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:39,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:39,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:39,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:39,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:39,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:39,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:39,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:39,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:39,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:39,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:39,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:39,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:39,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:39,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:39,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:39,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:39,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:39,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:39,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:39,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:39,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:39,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:39,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:40,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:40,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:40,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:40,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:40,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:40,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:40,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:40,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:40,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:40,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:40,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:40,008 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:58:40,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:40,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:40,009 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:58:40,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:40,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:40,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:40,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:40,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:40,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:40,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:40,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:40,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:40,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:40,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:40,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:40,020 INFO L205 nArgumentSynthesizer]: 6 stem disjuncts [2018-11-23 12:58:40,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:40,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:40,022 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 12:58:40,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:40,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:40,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:40,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:40,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:40,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:40,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:40,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:40,039 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:40,075 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 12:58:40,114 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 12:58:40,114 INFO L444 ModelExtractionUtils]: 70 out of 79 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-23 12:58:40,115 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 12:58:40,115 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 12:58:40,116 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 12:58:40,116 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_4, ULTIMATE.start_cstrncmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_4 - 1*ULTIMATE.start_cstrncmp_~s1.offset Supporting invariants [] [2018-11-23 12:58:40,356 INFO L297 tatePredicateManager]: 73 out of 74 supporting invariants were superfluous and have been removed [2018-11-23 12:58:40,357 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 12:58:40,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:40,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:58:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:40,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:58:40,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:58:40,416 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-23 12:58:40,416 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 62 transitions. cyclomatic complexity: 13 Second operand 6 states. [2018-11-23 12:58:40,452 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 62 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 108 states and 127 transitions. Complement of second has 9 states. [2018-11-23 12:58:40,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 12:58:40,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:58:40,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-11-23 12:58:40,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 25 letters. Loop has 5 letters. [2018-11-23 12:58:40,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:58:40,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 30 letters. Loop has 5 letters. [2018-11-23 12:58:40,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:58:40,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 25 letters. Loop has 10 letters. [2018-11-23 12:58:40,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:58:40,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 127 transitions. [2018-11-23 12:58:40,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 12:58:40,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 77 states and 91 transitions. [2018-11-23 12:58:40,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-23 12:58:40,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-23 12:58:40,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 91 transitions. [2018-11-23 12:58:40,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 12:58:40,459 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 91 transitions. [2018-11-23 12:58:40,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 91 transitions. [2018-11-23 12:58:40,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 54. [2018-11-23 12:58:40,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:58:40,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-11-23 12:58:40,461 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-23 12:58:40,461 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-23 12:58:40,461 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 12:58:40,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 63 transitions. [2018-11-23 12:58:40,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 12:58:40,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:58:40,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:58:40,463 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:58:40,463 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 12:58:40,463 INFO L794 eck$LassoCheckResult]: Stem: 1916#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1908#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 1897#L588 assume !(main_~length1~0 < 1); 1898#L588-2 assume !(main_~length2~0 < 1); 1888#L591-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 1889#L573 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 1890#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1891#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1879#L551-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 1880#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1892#L551-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1921#L551-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 1923#L551-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1920#L551-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1893#L551-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 1894#L553 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 1909#L575-4 goto; 1910#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1899#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 1900#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1925#L575-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 1929#L558 assume !(0 == cstrncmp_~n % 4294967296); 1927#L560-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 1896#L561 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;call cstrncmp_#t~mem9 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;call cstrncmp_#t~mem10 := read~int(cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, 1);cstrncmp_#res := cstrncmp_#t~mem9 % 256 - cstrncmp_#t~mem10 % 256;havoc cstrncmp_#t~mem9;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset;havoc cstrncmp_#t~mem10; 1901#L566 cstrstr_#t~ret16 := cstrncmp_#res; 1902#L575-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 1917#L575-4 goto; 1907#L576-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1924#L577 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 1903#L576 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1904#L575-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 1881#L558 assume !(0 == cstrncmp_~n % 4294967296); 1882#L560-4 [2018-11-23 12:58:40,463 INFO L796 eck$LassoCheckResult]: Loop: 1882#L560-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 1895#L561 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 1912#L563 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset;havoc cstrncmp_#t~mem12; 1913#L560-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 1885#L560-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 1882#L560-4 [2018-11-23 12:58:40,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:40,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2051218895, now seen corresponding path program 1 times [2018-11-23 12:58:40,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:40,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:40,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:40,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:40,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:40,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:40,491 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 4 times [2018-11-23 12:58:40,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:40,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:40,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:40,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:40,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:40,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:40,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1369353957, now seen corresponding path program 1 times [2018-11-23 12:58:40,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:40,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:40,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:40,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:58:40,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:58:40,648 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2018-11-23 12:58:41,603 WARN L180 SmtUtils]: Spent 935.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 249 [2018-11-23 12:58:42,033 WARN L180 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 149 [2018-11-23 12:58:42,034 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 12:58:42,035 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 12:58:42,035 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 12:58:42,035 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 12:58:42,035 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 12:58:42,035 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:58:42,035 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 12:58:42,035 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 12:58:42,035 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-termination.c.i_Iteration8_Lasso [2018-11-23 12:58:42,035 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 12:58:42,035 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 12:58:42,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,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-23 12:58:42,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,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-23 12:58:42,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,649 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 141 [2018-11-23 12:58:42,828 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2018-11-23 12:58:42,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:42,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:58:43,178 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-11-23 12:58:43,499 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2018-11-23 12:58:43,757 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 12:58:43,757 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 12:58:43,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:43,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:43,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:43,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:43,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:43,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:43,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:43,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:43,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:43,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:43,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:43,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:43,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:43,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:43,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:43,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:43,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:43,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:43,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:43,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:43,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:43,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:43,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:43,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:43,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:43,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:43,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:43,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:43,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:43,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:43,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:43,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:43,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:43,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:43,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:43,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:43,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:43,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:43,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:43,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:43,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:43,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:43,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:43,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:43,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:43,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:43,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:43,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:43,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:43,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:43,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:43,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:43,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:43,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:43,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:43,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:43,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:43,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:43,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:43,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:43,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:43,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:43,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:43,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:43,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:43,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:43,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:43,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:43,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:43,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:43,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:43,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:43,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:43,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:43,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:43,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:43,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:43,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:43,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:43,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:43,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:43,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:43,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:58:43,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:43,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:43,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:43,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:58:43,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:58:43,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:43,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:43,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:43,772 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:58:43,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:43,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:43,773 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:58:43,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:43,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:43,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:43,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:43,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:43,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:43,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:43,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:43,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:43,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:43,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:43,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:43,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:43,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:43,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:43,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:43,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:43,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:43,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:43,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:43,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:43,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:43,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:43,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:43,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:43,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:43,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:43,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:43,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:43,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:43,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:43,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:43,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:43,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:43,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:43,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:43,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:43,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:43,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:43,785 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:43,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:43,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:43,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:43,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:43,788 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-23 12:58:43,788 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 12:58:43,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:43,792 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2018-11-23 12:58:43,792 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 12:58:43,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:43,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:43,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:43,816 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:58:43,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:43,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:43,817 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:58:43,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:43,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:58:43,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:58:43,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:58:43,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:58:43,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:58:43,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:58:43,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:58:43,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:58:43,886 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 12:58:43,956 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-11-23 12:58:43,956 INFO L444 ModelExtractionUtils]: 69 out of 85 variables were initially zero. Simplification set additionally 13 variables to zero. [2018-11-23 12:58:43,957 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 12:58:43,957 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 12:58:43,957 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 12:58:43,957 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~s1.offset, v_rep(select #length ULTIMATE.start_cstrstr_~s.base)_2) = -1*ULTIMATE.start_cstrncmp_~s1.offset + 1*v_rep(select #length ULTIMATE.start_cstrstr_~s.base)_2 Supporting invariants [] [2018-11-23 12:58:44,196 INFO L297 tatePredicateManager]: 73 out of 74 supporting invariants were superfluous and have been removed [2018-11-23 12:58:44,197 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 12:58:44,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:44,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:58:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:44,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:58:44,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:58:44,268 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 12:58:44,268 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-23 12:58:44,298 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 80 states and 94 transitions. Complement of second has 8 states. [2018-11-23 12:58:44,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 12:58:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:58:44,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2018-11-23 12:58:44,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 32 letters. Loop has 5 letters. [2018-11-23 12:58:44,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:58:44,299 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 12:58:44,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:44,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:58:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:44,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:58:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:58:44,363 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 12:58:44,364 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-23 12:58:44,399 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 79 states and 93 transitions. Complement of second has 8 states. [2018-11-23 12:58:44,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 12:58:44,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:58:44,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-23 12:58:44,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 32 letters. Loop has 5 letters. [2018-11-23 12:58:44,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:58:44,400 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 12:58:44,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:44,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:58:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:44,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:58:44,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:58:44,480 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 12:58:44,480 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-23 12:58:44,530 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 82 states and 96 transitions. Complement of second has 7 states. [2018-11-23 12:58:44,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 12:58:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:58:44,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2018-11-23 12:58:44,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 32 letters. Loop has 5 letters. [2018-11-23 12:58:44,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:58:44,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 37 letters. Loop has 5 letters. [2018-11-23 12:58:44,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:58:44,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 32 letters. Loop has 10 letters. [2018-11-23 12:58:44,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:58:44,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 96 transitions. [2018-11-23 12:58:44,533 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 12:58:44,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 0 states and 0 transitions. [2018-11-23 12:58:44,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 12:58:44,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 12:58:44,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 12:58:44,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 12:58:44,534 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:58:44,534 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:58:44,534 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:58:44,534 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 12:58:44,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:58:44,534 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 12:58:44,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 12:58:44,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 12:58:44 BoogieIcfgContainer [2018-11-23 12:58:44,539 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 12:58:44,540 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:58:44,540 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:58:44,540 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:58:44,540 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:58:29" (3/4) ... [2018-11-23 12:58:44,543 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 12:58:44,543 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:58:44,544 INFO L168 Benchmark]: Toolchain (without parser) took 15698.79 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 529.5 MB). Free memory was 956.4 MB in the beginning and 1.5 GB in the end (delta: -553.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:58:44,545 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:58:44,545 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2018-11-23 12:58:44,545 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:58:44,546 INFO L168 Benchmark]: Boogie Preprocessor took 24.25 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:58:44,546 INFO L168 Benchmark]: RCFGBuilder took 302.92 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: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. [2018-11-23 12:58:44,546 INFO L168 Benchmark]: BuchiAutomizer took 15008.37 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 380.6 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -410.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:58:44,547 INFO L168 Benchmark]: Witness Printer took 3.73 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:58:44,549 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.25 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 302.92 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: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15008.37 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 380.6 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -410.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.73 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 5 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 4 locations. One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 9 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * s1 and consists of 6 locations. One nondeterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[s] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.9s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 13.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 48 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 54 states and ocurred in iteration 7. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 295 SDtfs, 362 SDslu, 586 SDs, 0 SdLazy, 252 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital304 mio100 ax106 hnf99 lsp91 ukn89 mio100 lsp47 div142 bol100 ite100 ukn100 eq171 hnf75 smp95 dnf128 smp89 tf100 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 12 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 28 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...