./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_65dc50fb-ed07-4700-9dd3-8191d8d15513/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_65dc50fb-ed07-4700-9dd3-8191d8d15513/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_65dc50fb-ed07-4700-9dd3-8191d8d15513/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_65dc50fb-ed07-4700-9dd3-8191d8d15513/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_65dc50fb-ed07-4700-9dd3-8191d8d15513/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_65dc50fb-ed07-4700-9dd3-8191d8d15513/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 32bit --witnessprinter.graph.data.programhash a7a59a18d7efd93cdbe5aac5e25a2b00fcb94883 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 10:07:49,448 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:07:49,450 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:07:49,458 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:07:49,458 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:07:49,459 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:07:49,460 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:07:49,461 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:07:49,462 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:07:49,462 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:07:49,463 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:07:49,463 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:07:49,463 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:07:49,464 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:07:49,465 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:07:49,465 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:07:49,466 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:07:49,467 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:07:49,468 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:07:49,469 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:07:49,470 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:07:49,470 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:07:49,472 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:07:49,472 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:07:49,472 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:07:49,473 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:07:49,473 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:07:49,474 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:07:49,474 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:07:49,475 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:07:49,475 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:07:49,475 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:07:49,476 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:07:49,476 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:07:49,476 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:07:49,477 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:07:49,477 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_65dc50fb-ed07-4700-9dd3-8191d8d15513/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 10:07:49,486 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:07:49,486 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:07:49,487 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:07:49,487 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:07:49,488 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:07:49,488 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 10:07:49,488 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 10:07:49,488 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 10:07:49,488 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 10:07:49,488 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 10:07:49,488 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 10:07:49,488 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:07:49,489 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:07:49,489 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 10:07:49,489 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:07:49,489 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:07:49,489 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:07:49,489 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 10:07:49,489 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 10:07:49,489 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 10:07:49,490 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:07:49,490 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:07:49,490 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 10:07:49,490 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:07:49,490 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 10:07:49,490 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:07:49,490 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:07:49,490 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 10:07:49,491 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:07:49,491 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:07:49,491 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 10:07:49,492 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 10:07:49,492 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_65dc50fb-ed07-4700-9dd3-8191d8d15513/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7a59a18d7efd93cdbe5aac5e25a2b00fcb94883 [2018-11-18 10:07:49,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:07:49,522 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:07:49,525 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:07:49,526 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:07:49,526 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:07:49,527 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_65dc50fb-ed07-4700-9dd3-8191d8d15513/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-11-18 10:07:49,559 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_65dc50fb-ed07-4700-9dd3-8191d8d15513/bin-2019/uautomizer/data/716f2dd3b/f7484069b47e487f8aec4f1eeb7474cc/FLAGa60160cca [2018-11-18 10:07:49,975 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:07:49,975 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_65dc50fb-ed07-4700-9dd3-8191d8d15513/sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-11-18 10:07:49,981 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_65dc50fb-ed07-4700-9dd3-8191d8d15513/bin-2019/uautomizer/data/716f2dd3b/f7484069b47e487f8aec4f1eeb7474cc/FLAGa60160cca [2018-11-18 10:07:49,989 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_65dc50fb-ed07-4700-9dd3-8191d8d15513/bin-2019/uautomizer/data/716f2dd3b/f7484069b47e487f8aec4f1eeb7474cc [2018-11-18 10:07:49,990 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:07:49,991 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:07:49,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:07:49,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:07:49,994 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:07:49,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:07:49" (1/1) ... [2018-11-18 10:07:49,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3270d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:49, skipping insertion in model container [2018-11-18 10:07:49,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:07:49" (1/1) ... [2018-11-18 10:07:50,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:07:50,027 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:07:50,212 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:07:50,218 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:07:50,285 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:07:50,312 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:07:50,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:50 WrapperNode [2018-11-18 10:07:50,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:07:50,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:07:50,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:07:50,313 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:07:50,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:50" (1/1) ... [2018-11-18 10:07:50,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:50" (1/1) ... [2018-11-18 10:07:50,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:07:50,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:07:50,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:07:50,351 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:07:50,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:50" (1/1) ... [2018-11-18 10:07:50,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:50" (1/1) ... [2018-11-18 10:07:50,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:50" (1/1) ... [2018-11-18 10:07:50,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:50" (1/1) ... [2018-11-18 10:07:50,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:50" (1/1) ... [2018-11-18 10:07:50,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:50" (1/1) ... [2018-11-18 10:07:50,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:50" (1/1) ... [2018-11-18 10:07:50,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:07:50,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:07:50,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:07:50,375 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:07:50,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65dc50fb-ed07-4700-9dd3-8191d8d15513/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-18 10:07:50,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 10:07:50,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 10:07:50,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 10:07:50,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 10:07:50,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:07:50,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:07:50,679 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:07:50,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:07:50 BoogieIcfgContainer [2018-11-18 10:07:50,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:07:50,680 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 10:07:50,680 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 10:07:50,682 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 10:07:50,683 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:07:50,683 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 10:07:49" (1/3) ... [2018-11-18 10:07:50,684 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cbc442e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:07:50, skipping insertion in model container [2018-11-18 10:07:50,684 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:07:50,684 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:07:50" (2/3) ... [2018-11-18 10:07:50,684 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cbc442e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:07:50, skipping insertion in model container [2018-11-18 10:07:50,684 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:07:50,684 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:07:50" (3/3) ... [2018-11-18 10:07:50,685 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-11-18 10:07:50,715 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:07:50,715 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 10:07:50,715 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 10:07:50,715 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 10:07:50,715 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:07:50,716 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:07:50,716 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 10:07:50,716 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:07:50,716 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 10:07:50,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-18 10:07:50,738 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-18 10:07:50,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:07:50,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:07:50,743 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:07:50,744 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:07:50,744 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 10:07:50,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-18 10:07:50,746 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-18 10:07:50,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:07:50,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:07:50,746 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:07:50,746 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:07:50,753 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 12#L581true assume !(main_~length1~0 < 1); 3#L581-2true assume !(main_~length2~0 < 1); 27#L584-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);assume { :begin_inline_cstrstr } true;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; 6#L566true assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;assume { :begin_inline_cstrlen } true;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; 30#L544-4true [2018-11-18 10:07:50,753 INFO L796 eck$LassoCheckResult]: Loop: 30#L544-4true assume true;call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 8#L544-1true assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 26#L544-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; 30#L544-4true [2018-11-18 10:07:50,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:07:50,756 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2018-11-18 10:07:50,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:07:50,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:07:50,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:50,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:07:50,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:50,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:07:50,860 INFO L82 PathProgramCache]: Analyzing trace with hash 51799, now seen corresponding path program 1 times [2018-11-18 10:07:50,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:07:50,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:07:50,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:50,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:07:50,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:50,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:07:50,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1298288364, now seen corresponding path program 1 times [2018-11-18 10:07:50,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:07:50,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:07:50,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:50,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:07:50,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:51,258 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2018-11-18 10:07:51,367 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2018-11-18 10:07:51,377 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:07:51,378 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:07:51,378 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:07:51,378 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:07:51,379 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:07:51,379 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:07:51,379 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:07:51,379 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:07:51,379 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-18 10:07:51,379 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:07:51,380 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:07:51,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,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-18 10:07:51,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:51,674 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2018-11-18 10:07:52,052 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:07:52,055 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:07:52,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:52,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:52,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:52,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:52,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:52,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:52,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:52,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:52,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:52,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:52,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:52,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:52,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:52,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:52,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:52,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,078 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:07:52,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:07:52,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:52,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:52,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:52,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:52,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:52,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:52,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:52,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:52,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:52,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:52,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:52,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:52,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:52,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:52,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:52,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:52,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:52,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:52,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:07:52,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:07:52,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:52,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:52,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:52,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:52,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:52,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:52,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:52,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:52,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:52,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:52,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:52,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:52,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:52,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:52,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:52,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:52,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:52,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:52,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:52,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:52,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:52,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:52,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:52,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:52,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:52,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:52,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:52,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:52,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:52,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:52,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:52,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:52,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:52,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:52,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:52,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:52,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,145 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:07:52,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:07:52,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:07:52,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:07:52,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:07:52,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:07:52,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:52,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,171 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:07:52,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,172 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:07:52,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:07:52,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,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-18 10:07:52,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,182 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:07:52,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,184 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:07:52,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:07:52,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:52,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-18 10:07:52,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:52,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:52,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:52,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:52,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:07:52,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:07:52,223 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:07:52,240 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 10:07:52,240 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:07:52,242 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:07:52,243 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:07:52,244 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:07:52,245 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-18 10:07:52,297 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-18 10:07:52,302 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 10:07:52,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:07:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:07:52,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:07:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:07:52,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:07:52,366 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-18 10:07:52,375 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-18 10:07:52,376 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 4 states. [2018-11-18 10:07:52,452 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-18 10:07:52,454 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-18 10:07:52,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:07:52,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2018-11-18 10:07:52,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-18 10:07:52,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:07:52,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-18 10:07:52,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:07:52,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-18 10:07:52,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:07:52,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 111 transitions. [2018-11-18 10:07:52,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 10:07:52,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 27 states and 36 transitions. [2018-11-18 10:07:52,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-18 10:07:52,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-18 10:07:52,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2018-11-18 10:07:52,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:07:52,464 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-18 10:07:52,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2018-11-18 10:07:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-18 10:07:52,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 10:07:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2018-11-18 10:07:52,480 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-18 10:07:52,480 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-18 10:07:52,480 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 10:07:52,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2018-11-18 10:07:52,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 10:07:52,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:07:52,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:07:52,481 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:07:52,481 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:07:52,481 INFO L794 eck$LassoCheckResult]: Stem: 254#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 244#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 245#L581 assume !(main_~length1~0 < 1); 231#L581-2 assume !(main_~length2~0 < 1); 232#L584-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);assume { :begin_inline_cstrstr } true;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; 237#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;assume { :begin_inline_cstrlen } true;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; 238#L544-4 assume true;call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 240#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 241#L544-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); 233#L546 cstrstr_#t~ret15 := cstrlen_#res;assume { :end_inline_cstrlen } true;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 234#L568-4 [2018-11-18 10:07:52,482 INFO L796 eck$LassoCheckResult]: Loop: 234#L568-4 assume true; 250#L569-3 assume true;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; 246#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 247#L569-1 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 235#L568-1 assume { :begin_inline_cstrncmp } true;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; 236#L551 assume 0 == cstrncmp_~n % 4294967296;cstrncmp_#res := 0; 248#L559 cstrstr_#t~ret16 := cstrncmp_#res;assume { :end_inline_cstrncmp } true; 239#L568-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 234#L568-4 [2018-11-18 10:07:52,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:07:52,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231857, now seen corresponding path program 1 times [2018-11-18 10:07:52,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:07:52,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:07:52,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:52,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:07:52,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:52,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:07:52,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1625363791, now seen corresponding path program 1 times [2018-11-18 10:07:52,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:07:52,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:07:52,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:52,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:07:52,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:07:52,542 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-18 10:07:52,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:07:52,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:07:52,544 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:07:52,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:07:52,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:07:52,547 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-18 10:07:52,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:07:52,572 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2018-11-18 10:07:52,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:07:52,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2018-11-18 10:07:52,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-18 10:07:52,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 32 transitions. [2018-11-18 10:07:52,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-18 10:07:52,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-18 10:07:52,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2018-11-18 10:07:52,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:07:52,575 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-18 10:07:52,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2018-11-18 10:07:52,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-18 10:07:52,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 10:07:52,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-11-18 10:07:52,577 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-18 10:07:52,577 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-18 10:07:52,577 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 10:07:52,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2018-11-18 10:07:52,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-18 10:07:52,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:07:52,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:07:52,578 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:07:52,578 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:07:52,578 INFO L794 eck$LassoCheckResult]: Stem: 318#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 316#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 317#L581 assume !(main_~length1~0 < 1); 296#L581-2 assume !(main_~length2~0 < 1); 297#L584-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);assume { :begin_inline_cstrstr } true;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; 306#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;assume { :begin_inline_cstrlen } true;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; 307#L544-4 assume true;call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 312#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 313#L544-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); 301#L546 cstrstr_#t~ret15 := cstrlen_#res;assume { :end_inline_cstrlen } true;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 302#L568-4 [2018-11-18 10:07:52,578 INFO L796 eck$LassoCheckResult]: Loop: 302#L568-4 assume true; 300#L569-3 assume true;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; 308#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 298#L569-1 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 299#L568-1 assume { :begin_inline_cstrncmp } true;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; 303#L551 assume !(0 == cstrncmp_~n % 4294967296); 321#L553-4 assume true;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#L554 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;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; 311#L559 cstrstr_#t~ret16 := cstrncmp_#res;assume { :end_inline_cstrncmp } true; 309#L568-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 302#L568-4 [2018-11-18 10:07:52,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:07:52,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231857, now seen corresponding path program 2 times [2018-11-18 10:07:52,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:07:52,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:07:52,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:52,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:07:52,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:52,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:07:52,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1394633302, now seen corresponding path program 1 times [2018-11-18 10:07:52,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:07:52,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:07:52,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:52,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:07:52,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:52,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:07:52,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1959138822, now seen corresponding path program 1 times [2018-11-18 10:07:52,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:07:52,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:07:52,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:52,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:07:52,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:07:52,692 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-18 10:07:52,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:07:52,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 10:07:52,853 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2018-11-18 10:07:52,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:07:52,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:07:52,917 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-18 10:07:52,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:07:52,973 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-11-18 10:07:52,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:07:52,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2018-11-18 10:07:52,975 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-18 10:07:52,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 41 transitions. [2018-11-18 10:07:52,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-18 10:07:52,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-18 10:07:52,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2018-11-18 10:07:52,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:07:52,977 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-18 10:07:52,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2018-11-18 10:07:52,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-18 10:07:52,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 10:07:52,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-18 10:07:52,983 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-18 10:07:52,983 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-18 10:07:52,983 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 10:07:52,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2018-11-18 10:07:52,984 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-18 10:07:52,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:07:52,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:07:52,984 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:07:52,984 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:07:52,984 INFO L794 eck$LassoCheckResult]: Stem: 399#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 397#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 398#L581 assume !(main_~length1~0 < 1); 376#L581-2 assume !(main_~length2~0 < 1); 377#L584-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);assume { :begin_inline_cstrstr } true;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; 386#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;assume { :begin_inline_cstrlen } true;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; 387#L544-4 assume true;call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 393#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 394#L544-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); 380#L546 cstrstr_#t~ret15 := cstrlen_#res;assume { :end_inline_cstrlen } true;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 381#L568-4 assume true; 379#L569-3 [2018-11-18 10:07:52,984 INFO L796 eck$LassoCheckResult]: Loop: 379#L569-3 assume true;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; 388#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 378#L569-1 assume !!(cstrstr_~sc~0 != cstrstr_~c~0); 379#L569-3 [2018-11-18 10:07:52,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:07:52,985 INFO L82 PathProgramCache]: Analyzing trace with hash 2114547350, now seen corresponding path program 1 times [2018-11-18 10:07:52,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:07:52,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:07:52,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:52,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:07:52,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:53,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:07:53,006 INFO L82 PathProgramCache]: Analyzing trace with hash 72656, now seen corresponding path program 1 times [2018-11-18 10:07:53,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:07:53,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:07:53,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:53,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:07:53,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:53,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:07:53,010 INFO L82 PathProgramCache]: Analyzing trace with hash 194816283, now seen corresponding path program 1 times [2018-11-18 10:07:53,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:07:53,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:07:53,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:53,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:07:53,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:53,298 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 123 [2018-11-18 10:07:53,562 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2018-11-18 10:07:53,563 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:07:53,563 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:07:53,563 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:07:53,563 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:07:53,563 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:07:53,563 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:07:53,564 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:07:53,564 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:07:53,564 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-18 10:07:53,564 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:07:53,564 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:07:53,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:53,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:53,798 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2018-11-18 10:07:53,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:53,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:53,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:53,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:53,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:53,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:53,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:53,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:53,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:53,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:53,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:53,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:53,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:53,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:53,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:53,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:53,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:53,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:53,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:53,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:53,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:53,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:54,261 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:07:54,261 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:07:54,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:54,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:54,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:54,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:54,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:54,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:54,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:54,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:54,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:54,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:54,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:54,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:54,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:54,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:54,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:07:54,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:07:54,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:54,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:54,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:54,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:54,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:54,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:54,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:07:54,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:07:54,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:54,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:54,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:54,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:54,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:54,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:54,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:07:54,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:07:54,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:54,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:54,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:54,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:54,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:54,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:54,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:07:54,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:07:54,311 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:07:54,325 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 10:07:54,325 INFO L444 ModelExtractionUtils]: 54 out of 58 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:07:54,325 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:07:54,327 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:07:54,327 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:07:54,327 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-18 10:07:54,392 INFO L297 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2018-11-18 10:07:54,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 10:07:54,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:07:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:07:54,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:07:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:07:54,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:07:54,441 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-18 10:07:54,442 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-18 10:07:54,442 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-18 10:07:54,469 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-18 10:07:54,470 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-18 10:07:54,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:07:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-11-18 10:07:54,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 10:07:54,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:07:54,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-18 10:07:54,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:07:54,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-18 10:07:54,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:07:54,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2018-11-18 10:07:54,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 10:07:54,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 36 states and 42 transitions. [2018-11-18 10:07:54,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-18 10:07:54,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-18 10:07:54,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2018-11-18 10:07:54,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:07:54,473 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-18 10:07:54,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2018-11-18 10:07:54,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-18 10:07:54,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 10:07:54,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-18 10:07:54,475 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-18 10:07:54,475 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-18 10:07:54,475 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 10:07:54,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2018-11-18 10:07:54,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 10:07:54,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:07:54,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:07:54,476 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-18 10:07:54,476 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:07:54,476 INFO L794 eck$LassoCheckResult]: Stem: 646#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 644#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 645#L581 assume !(main_~length1~0 < 1); 616#L581-2 assume !(main_~length2~0 < 1); 617#L584-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);assume { :begin_inline_cstrstr } true;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; 635#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;assume { :begin_inline_cstrlen } true;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; 636#L544-4 assume true;call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 642#L544-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 643#L544-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; 649#L544-4 assume true;call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 640#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 641#L544-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); 623#L546 cstrstr_#t~ret15 := cstrlen_#res;assume { :end_inline_cstrlen } true;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 624#L568-4 assume true; 631#L569-3 assume true;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; 632#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 618#L569-1 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 619#L568-1 assume { :begin_inline_cstrncmp } true;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; 625#L551 assume !(0 == cstrncmp_~n % 4294967296); 650#L553-4 [2018-11-18 10:07:54,476 INFO L796 eck$LassoCheckResult]: Loop: 650#L553-4 assume true;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); 637#L554 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;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); 627#L556 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset;havoc cstrncmp_#t~mem12; 628#L553-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 647#L553-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 650#L553-4 [2018-11-18 10:07:54,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:07:54,477 INFO L82 PathProgramCache]: Analyzing trace with hash -911304322, now seen corresponding path program 1 times [2018-11-18 10:07:54,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:07:54,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:07:54,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:54,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:07:54,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:54,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:07:54,498 INFO L82 PathProgramCache]: Analyzing trace with hash 92726540, now seen corresponding path program 1 times [2018-11-18 10:07:54,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:07:54,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:07:54,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:54,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:07:54,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:54,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:07:54,507 INFO L82 PathProgramCache]: Analyzing trace with hash 56471983, now seen corresponding path program 1 times [2018-11-18 10:07:54,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:07:54,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:07:54,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:54,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:07:54,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:07:54,633 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-18 10:07:54,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:07:54,634 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65dc50fb-ed07-4700-9dd3-8191d8d15513/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-18 10:07:54,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:07:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:07:54,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:07:54,703 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-18 10:07:54,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:07:54,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-11-18 10:07:54,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 10:07:54,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-11-18 10:07:54,801 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 9 Second operand 12 states. [2018-11-18 10:07:54,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:07:54,887 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-11-18 10:07:54,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 10:07:54,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 83 transitions. [2018-11-18 10:07:54,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 10:07:54,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 41 states and 47 transitions. [2018-11-18 10:07:54,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-18 10:07:54,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-18 10:07:54,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2018-11-18 10:07:54,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:07:54,889 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-18 10:07:54,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2018-11-18 10:07:54,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-18 10:07:54,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 10:07:54,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-11-18 10:07:54,893 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-11-18 10:07:54,893 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-11-18 10:07:54,893 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 10:07:54,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2018-11-18 10:07:54,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 10:07:54,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:07:54,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:07:54,894 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-18 10:07:54,894 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:07:54,895 INFO L794 eck$LassoCheckResult]: Stem: 849#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 847#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 848#L581 assume !(main_~length1~0 < 1); 819#L581-2 assume !(main_~length2~0 < 1); 820#L584-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);assume { :begin_inline_cstrstr } true;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; 836#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;assume { :begin_inline_cstrlen } true;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; 837#L544-4 assume true;call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 856#L544-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 852#L544-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; 853#L544-4 assume true;call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 845#L544-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 846#L544-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#L544-4 assume true;call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 843#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 844#L544-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); 826#L546 cstrstr_#t~ret15 := cstrlen_#res;assume { :end_inline_cstrlen } true;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 827#L568-4 assume true; 834#L569-3 assume true;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; 835#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 821#L569-1 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 822#L568-1 assume { :begin_inline_cstrncmp } true;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; 828#L551 assume !(0 == cstrncmp_~n % 4294967296); 854#L553-4 [2018-11-18 10:07:54,895 INFO L796 eck$LassoCheckResult]: Loop: 854#L553-4 assume true;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); 840#L554 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;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); 830#L556 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset;havoc cstrncmp_#t~mem12; 831#L553-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 850#L553-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 854#L553-4 [2018-11-18 10:07:54,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:07:54,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1479184926, now seen corresponding path program 2 times [2018-11-18 10:07:54,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:07:54,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:07:54,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:54,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:07:54,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:54,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:07:54,913 INFO L82 PathProgramCache]: Analyzing trace with hash 92726540, now seen corresponding path program 2 times [2018-11-18 10:07:54,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:07:54,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:07:54,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:54,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:07:54,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:54,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:07:54,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1935401713, now seen corresponding path program 2 times [2018-11-18 10:07:54,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:07:54,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:07:54,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:54,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:07:54,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:55,593 WARN L180 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 181 [2018-11-18 10:07:56,013 WARN L180 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 141 [2018-11-18 10:07:56,015 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:07:56,015 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:07:56,015 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:07:56,015 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:07:56,015 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:07:56,015 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:07:56,015 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:07:56,015 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:07:56,015 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-18 10:07:56,015 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:07:56,015 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:07:56,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:56,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:56,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:56,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:56,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:56,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:56,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:56,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:56,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-18 10:07:56,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-18 10:07:56,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-18 10:07:56,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-18 10:07:56,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:56,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-18 10:07:56,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-18 10:07:56,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-18 10:07:56,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-18 10:07:56,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-18 10:07:56,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-18 10:07:56,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-18 10:07:56,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:56,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-18 10:07:56,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-18 10:07:56,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-18 10:07:56,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-18 10:07:56,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-18 10:07:56,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-18 10:07:56,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-18 10:07:56,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-18 10:07:56,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-18 10:07:56,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:56,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:56,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:56,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:56,563 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 132 [2018-11-18 10:07:56,706 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2018-11-18 10:07:56,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:56,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:56,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:56,987 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2018-11-18 10:07:57,429 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:07:57,429 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:07:57,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,438 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,441 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:07:57,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:07:57,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,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-18 10:07:57,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:07:57,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:07:57,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:07:57,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:07:57,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,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-18 10:07:57,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,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-18 10:07:57,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,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-18 10:07:57,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,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-18 10:07:57,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:07:57,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:07:57,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:07:57,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,485 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:07:57,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,485 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:07:57,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:07:57,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,488 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:07:57,488 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:07:57,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,490 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-18 10:07:57,490 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 10:07:57,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:07:57,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:07:57,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,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-18 10:07:57,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,504 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:07:57,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,506 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:07:57,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:07:57,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,515 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:07:57,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,516 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:07:57,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:07:57,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:07:57,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:07:57,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:07:57,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,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-18 10:07:57,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:07:57,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:07:57,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,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-18 10:07:57,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:07:57,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:07:57,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:07:57,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-18 10:07:57,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:07:57,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:07:57,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:07:57,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:07:57,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:07:57,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:07:57,605 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:07:57,653 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 10:07:57,653 INFO L444 ModelExtractionUtils]: 77 out of 85 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-18 10:07:57,654 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:07:57,656 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:07:57,656 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:07:57,656 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrstr_#in~s.base)_1, ULTIMATE.start_cstrncmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrstr_#in~s.base)_1 - 1*ULTIMATE.start_cstrncmp_~s1.offset Supporting invariants [] [2018-11-18 10:07:57,791 INFO L297 tatePredicateManager]: 51 out of 53 supporting invariants were superfluous and have been removed [2018-11-18 10:07:57,794 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 10:07:57,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:07:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:07:57,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:07:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:07:57,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:07:57,868 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-18 10:07:57,868 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-18 10:07:57,868 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-18 10:07:57,910 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9. Second operand 6 states. Result 86 states and 99 transitions. Complement of second has 9 states. [2018-11-18 10:07:57,911 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-18 10:07:57,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 10:07:57,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-11-18 10:07:57,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 22 letters. Loop has 5 letters. [2018-11-18 10:07:57,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:07:57,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 27 letters. Loop has 5 letters. [2018-11-18 10:07:57,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:07:57,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 22 letters. Loop has 10 letters. [2018-11-18 10:07:57,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:07:57,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 99 transitions. [2018-11-18 10:07:57,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 10:07:57,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 63 states and 74 transitions. [2018-11-18 10:07:57,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-18 10:07:57,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-18 10:07:57,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 74 transitions. [2018-11-18 10:07:57,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:07:57,916 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-11-18 10:07:57,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 74 transitions. [2018-11-18 10:07:57,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-11-18 10:07:57,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-18 10:07:57,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-11-18 10:07:57,920 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-18 10:07:57,920 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-18 10:07:57,920 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 10:07:57,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 63 transitions. [2018-11-18 10:07:57,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 10:07:57,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:07:57,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:07:57,921 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-18 10:07:57,921 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:07:57,921 INFO L794 eck$LassoCheckResult]: Stem: 1306#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1304#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 1305#L581 assume !(main_~length1~0 < 1); 1273#L581-2 assume !(main_~length2~0 < 1); 1274#L584-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);assume { :begin_inline_cstrstr } true;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; 1290#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;assume { :begin_inline_cstrlen } true;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; 1291#L544-4 assume true;call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1302#L544-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1303#L544-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#L544-4 assume true;call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1313#L544-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1316#L544-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; 1315#L544-4 assume true;call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1300#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1301#L544-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); 1280#L546 cstrstr_#t~ret15 := cstrlen_#res;assume { :end_inline_cstrlen } true;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 1281#L568-4 assume true; 1292#L569-3 assume true;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; 1293#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 1314#L569-1 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1283#L568-1 assume { :begin_inline_cstrncmp } true;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; 1284#L551 assume !(0 == cstrncmp_~n % 4294967296); 1311#L553-4 assume true;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); 1298#L554 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;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; 1299#L559 cstrstr_#t~ret16 := cstrncmp_#res;assume { :end_inline_cstrncmp } true; 1295#L568-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 1296#L568-4 assume true; 1279#L569-3 assume true;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; 1294#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 1275#L569-1 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1276#L568-1 assume { :begin_inline_cstrncmp } true;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; 1282#L551 assume !(0 == cstrncmp_~n % 4294967296); 1310#L553-4 [2018-11-18 10:07:57,921 INFO L796 eck$LassoCheckResult]: Loop: 1310#L553-4 assume true;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); 1297#L554 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;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); 1285#L556 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset;havoc cstrncmp_#t~mem12; 1286#L553-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 1307#L553-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 1310#L553-4 [2018-11-18 10:07:57,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:07:57,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1911770291, now seen corresponding path program 1 times [2018-11-18 10:07:57,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:07:57,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:07:57,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:57,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:07:57,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:57,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:07:57,952 INFO L82 PathProgramCache]: Analyzing trace with hash 92726540, now seen corresponding path program 3 times [2018-11-18 10:07:57,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:07:57,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:07:57,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:57,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:07:57,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:57,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:07:57,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1283344486, now seen corresponding path program 1 times [2018-11-18 10:07:57,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:07:57,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:07:57,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:57,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:07:57,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:07:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:07:59,112 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 321 DAG size of output: 251 [2018-11-18 10:07:59,599 WARN L180 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 154 [2018-11-18 10:07:59,601 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:07:59,601 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:07:59,601 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:07:59,601 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:07:59,601 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:07:59,601 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:07:59,601 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:07:59,601 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:07:59,601 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2018-11-18 10:07:59,601 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:07:59,601 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:07:59,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:59,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:59,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:59,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:59,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:59,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:07:59,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,273 WARN L180 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 142 [2018-11-18 10:08:00,458 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 94 [2018-11-18 10:08:00,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:08:00,718 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2018-11-18 10:08:00,852 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-11-18 10:08:01,439 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2018-11-18 10:08:01,509 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:08:01,509 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:08:01,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-18 10:08:01,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:01,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:08:01,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:01,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:01,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:01,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:08:01,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:08:01,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:01,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-18 10:08:01,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:01,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:08:01,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:01,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:01,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:01,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:08:01,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:08:01,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:01,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-18 10:08:01,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:01,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:08:01,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:01,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:01,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:01,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:08:01,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:08:01,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:01,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-18 10:08:01,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:01,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:08:01,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:01,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:01,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:01,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:08:01,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:08:01,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:01,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:08:01,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:01,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:08:01,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:01,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:01,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:01,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:08:01,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:08:01,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:01,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-18 10:08:01,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:01,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:08:01,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:01,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:01,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:01,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:08:01,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:08:01,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:01,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:08:01,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:01,516 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:08:01,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:01,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:01,517 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:08:01,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:08:01,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:01,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-18 10:08:01,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:01,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:01,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:01,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:01,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:08:01,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:08:01,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:01,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:08:01,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:01,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:01,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:01,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:01,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:08:01,521 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:08:01,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:01,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-18 10:08:01,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:01,524 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:08:01,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:01,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:01,526 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:08:01,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:08:01,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:01,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-18 10:08:01,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:01,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:01,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:01,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:01,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:08:01,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:08:01,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:01,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-18 10:08:01,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:01,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:01,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:01,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:01,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:08:01,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:08:01,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:01,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:08:01,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:01,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:01,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:01,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:01,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:08:01,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:08:01,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:08:01,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:08:01,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:08:01,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:08:01,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:08:01,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:08:01,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:08:01,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:08:01,583 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:08:01,633 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-18 10:08:01,633 INFO L444 ModelExtractionUtils]: 69 out of 79 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-18 10:08:01,634 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:08:01,634 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:08:01,634 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:08:01,634 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-18 10:08:01,935 INFO L297 tatePredicateManager]: 81 out of 82 supporting invariants were superfluous and have been removed [2018-11-18 10:08:01,936 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 10:08:01,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:01,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:08:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:01,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:08:02,014 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-18 10:08:02,014 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-18 10:08:02,014 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 6 states. [2018-11-18 10:08:02,050 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 80 states and 94 transitions. Complement of second has 9 states. [2018-11-18 10:08:02,050 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-18 10:08:02,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 10:08:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-11-18 10:08:02,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 32 letters. Loop has 5 letters. [2018-11-18 10:08:02,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:08:02,051 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:08:02,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:02,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:08:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:02,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:08:02,123 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-18 10:08:02,123 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-18 10:08:02,123 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 6 states. [2018-11-18 10:08:02,178 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 79 states and 93 transitions. Complement of second has 9 states. [2018-11-18 10:08:02,178 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-18 10:08:02,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 10:08:02,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2018-11-18 10:08:02,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 32 letters. Loop has 5 letters. [2018-11-18 10:08:02,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:08:02,178 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:08:02,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:02,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:08:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:02,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:08:02,239 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-18 10:08:02,239 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-18 10:08:02,239 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 6 states. [2018-11-18 10:08:02,276 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 82 states and 96 transitions. Complement of second has 8 states. [2018-11-18 10:08:02,277 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-18 10:08:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 10:08:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2018-11-18 10:08:02,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 32 letters. Loop has 5 letters. [2018-11-18 10:08:02,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:08:02,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 37 letters. Loop has 5 letters. [2018-11-18 10:08:02,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:08:02,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 32 letters. Loop has 10 letters. [2018-11-18 10:08:02,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:08:02,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 96 transitions. [2018-11-18 10:08:02,280 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 10:08:02,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 0 states and 0 transitions. [2018-11-18 10:08:02,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 10:08:02,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 10:08:02,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 10:08:02,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:08:02,281 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:08:02,281 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:08:02,281 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:08:02,281 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 10:08:02,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 10:08:02,281 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 10:08:02,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 10:08:02,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 10:08:02 BoogieIcfgContainer [2018-11-18 10:08:02,287 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 10:08:02,287 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:08:02,287 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:08:02,287 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:08:02,288 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:07:50" (3/4) ... [2018-11-18 10:08:02,290 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 10:08:02,290 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:08:02,291 INFO L168 Benchmark]: Toolchain (without parser) took 12300.22 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 460.8 MB). Free memory was 952.1 MB in the beginning and 1.4 GB in the end (delta: -452.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:08:02,292 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:08:02,292 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 952.1 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2018-11-18 10:08:02,293 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 10:08:02,293 INFO L168 Benchmark]: Boogie Preprocessor took 23.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 10:08:02,293 INFO L168 Benchmark]: RCFGBuilder took 304.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:08:02,294 INFO L168 Benchmark]: BuchiAutomizer took 11606.85 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 351.3 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -342.0 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2018-11-18 10:08:02,294 INFO L168 Benchmark]: Witness Printer took 3.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:08:02,297 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 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 320.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 952.1 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 304.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11606.85 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 351.3 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -342.0 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 3 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 unknown-#length-unknown[s] + -1 * s1 and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * s1 and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.5s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 10.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 54 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 267 SDtfs, 368 SDslu, 547 SDs, 0 SdLazy, 219 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital292 mio100 ax100 hnf99 lsp97 ukn89 mio100 lsp46 div139 bol100 ite100 ukn100 eq171 hnf76 smp94 dnf146 smp87 tf100 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...