./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_473e5f28-7308-4916-8f56-53a244d406a3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_473e5f28-7308-4916-8f56-53a244d406a3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_473e5f28-7308-4916-8f56-53a244d406a3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_473e5f28-7308-4916-8f56-53a244d406a3/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_473e5f28-7308-4916-8f56-53a244d406a3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_473e5f28-7308-4916-8f56-53a244d406a3/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-0cd3be1 [2018-11-28 13:28:06,828 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:28:06,829 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:28:06,837 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:28:06,837 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:28:06,838 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:28:06,839 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:28:06,840 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:28:06,841 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:28:06,841 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:28:06,842 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:28:06,842 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:28:06,843 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:28:06,843 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:28:06,844 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:28:06,845 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:28:06,845 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:28:06,846 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:28:06,848 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:28:06,849 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:28:06,849 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:28:06,850 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:28:06,852 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:28:06,852 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:28:06,852 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:28:06,853 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:28:06,853 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:28:06,854 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:28:06,855 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:28:06,855 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:28:06,856 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:28:06,856 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:28:06,856 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:28:06,856 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:28:06,857 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:28:06,857 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:28:06,857 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_473e5f28-7308-4916-8f56-53a244d406a3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 13:28:06,865 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:28:06,866 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:28:06,867 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:28:06,867 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:28:06,867 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:28:06,867 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 13:28:06,867 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 13:28:06,867 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 13:28:06,868 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 13:28:06,868 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 13:28:06,868 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 13:28:06,868 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:28:06,868 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:28:06,868 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:28:06,868 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:28:06,869 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:28:06,869 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:28:06,869 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 13:28:06,869 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 13:28:06,869 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 13:28:06,869 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:28:06,869 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:28:06,870 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 13:28:06,870 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:28:06,870 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 13:28:06,870 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:28:06,870 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:28:06,870 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 13:28:06,871 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:28:06,871 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:28:06,871 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 13:28:06,872 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 13:28:06,872 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_473e5f28-7308-4916-8f56-53a244d406a3/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-28 13:28:06,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:28:06,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:28:06,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:28:06,914 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:28:06,914 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:28:06,915 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_473e5f28-7308-4916-8f56-53a244d406a3/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-11-28 13:28:06,971 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_473e5f28-7308-4916-8f56-53a244d406a3/bin-2019/uautomizer/data/728977664/206d5352769e47c791fee90b25a23fc2/FLAG9068491d8 [2018-11-28 13:28:07,336 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:28:07,336 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_473e5f28-7308-4916-8f56-53a244d406a3/sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-11-28 13:28:07,346 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_473e5f28-7308-4916-8f56-53a244d406a3/bin-2019/uautomizer/data/728977664/206d5352769e47c791fee90b25a23fc2/FLAG9068491d8 [2018-11-28 13:28:07,732 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_473e5f28-7308-4916-8f56-53a244d406a3/bin-2019/uautomizer/data/728977664/206d5352769e47c791fee90b25a23fc2 [2018-11-28 13:28:07,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:28:07,735 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:28:07,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:28:07,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:28:07,738 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:28:07,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:28:07" (1/1) ... [2018-11-28 13:28:07,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee50a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:07, skipping insertion in model container [2018-11-28 13:28:07,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:28:07" (1/1) ... [2018-11-28 13:28:07,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:28:07,769 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:28:07,949 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:28:07,957 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:28:08,031 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:28:08,063 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:28:08,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:08 WrapperNode [2018-11-28 13:28:08,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:28:08,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:28:08,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:28:08,065 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:28:08,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:08" (1/1) ... [2018-11-28 13:28:08,084 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:08" (1/1) ... [2018-11-28 13:28:08,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:28:08,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:28:08,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:28:08,104 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:28:08,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:08" (1/1) ... [2018-11-28 13:28:08,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:08" (1/1) ... [2018-11-28 13:28:08,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:08" (1/1) ... [2018-11-28 13:28:08,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:08" (1/1) ... [2018-11-28 13:28:08,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:08" (1/1) ... [2018-11-28 13:28:08,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:08" (1/1) ... [2018-11-28 13:28:08,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:08" (1/1) ... [2018-11-28 13:28:08,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:28:08,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:28:08,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:28:08,129 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:28:08,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_473e5f28-7308-4916-8f56-53a244d406a3/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:28:08,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:28:08,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:28:08,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:28:08,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:28:08,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:28:08,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:28:08,438 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:28:08,439 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-28 13:28:08,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:28:08 BoogieIcfgContainer [2018-11-28 13:28:08,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:28:08,441 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 13:28:08,441 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 13:28:08,443 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 13:28:08,444 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:28:08,444 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 01:28:07" (1/3) ... [2018-11-28 13:28:08,444 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@245e651e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:28:08, skipping insertion in model container [2018-11-28 13:28:08,445 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:28:08,445 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:08" (2/3) ... [2018-11-28 13:28:08,445 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@245e651e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:28:08, skipping insertion in model container [2018-11-28 13:28:08,445 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:28:08,445 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:28:08" (3/3) ... [2018-11-28 13:28:08,446 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-11-28 13:28:08,479 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:28:08,480 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 13:28:08,480 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 13:28:08,480 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 13:28:08,480 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:28:08,480 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:28:08,480 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 13:28:08,480 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:28:08,480 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 13:28:08,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-28 13:28:08,502 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-28 13:28:08,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:28:08,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:28:08,508 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 13:28:08,509 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:28:08,509 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 13:28:08,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-28 13:28:08,511 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-28 13:28:08,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:28:08,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:28:08,511 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 13:28:08,511 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:28:08,518 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 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);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~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;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-28 13:28:08,518 INFO L796 eck$LassoCheckResult]: Loop: 30#L544-4true 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-28 13:28:08,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:08,522 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2018-11-28 13:28:08,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:08,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:08,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:08,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:08,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:08,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:08,633 INFO L82 PathProgramCache]: Analyzing trace with hash 51799, now seen corresponding path program 1 times [2018-11-28 13:28:08,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:08,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:08,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:08,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:08,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:08,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:08,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1298288364, now seen corresponding path program 1 times [2018-11-28 13:28:08,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:08,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:08,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:08,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:08,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:09,042 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 107 [2018-11-28 13:28:09,178 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-11-28 13:28:09,189 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:28:09,190 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:28:09,190 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:28:09,190 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:28:09,191 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:28:09,191 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:28:09,191 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:28:09,191 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:28:09,191 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-28 13:28:09,192 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:28:09,192 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:28:09,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:09,512 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2018-11-28 13:28:09,932 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:28:09,936 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:28:09,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:09,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:09,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:09,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:09,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:09,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:09,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:09,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:09,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:09,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:09,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:09,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:09,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:09,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:09,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:09,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:09,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:09,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:09,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:09,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:09,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,956 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:28:09,956 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:09,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:09,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:09,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:09,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:09,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:09,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:09,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:09,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:09,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:09,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:09,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:09,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:09,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:09,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:09,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:09,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:09,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:09,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:09,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:09,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:09,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:09,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:09,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:09,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:09,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:09,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:28:09,973 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:09,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:09,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:09,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:09,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:09,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:09,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:09,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,980 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:09,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:09,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:09,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:09,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:09,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:09,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:09,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:09,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:09,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:09,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:09,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:09,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:09,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:09,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:09,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:09,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:09,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:09,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:09,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:09,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:09,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:09,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:09,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:09,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:09,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:09,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:09,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:09,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:09,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:09,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:09,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:09,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:09,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:09,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:09,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:09,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:09,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:09,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:09,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:09,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:09,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:09,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:10,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:10,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:10,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:10,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:10,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:10,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:10,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:10,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:10,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:10,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:10,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:10,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:10,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:10,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:10,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:10,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:28:10,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:10,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:10,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:10,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:10,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:10,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:10,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:10,009 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:28:10,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:10,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:10,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:10,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:10,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:10,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:10,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:10,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:28:10,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:10,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:10,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:10,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:10,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:10,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:10,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:10,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:28:10,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:10,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:10,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:10,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:10,027 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:28:10,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:10,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:10,028 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:28:10,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:10,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:10,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:10,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:10,034 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:28:10,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:10,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:10,036 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:28:10,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:10,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:10,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:10,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:10,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:10,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:10,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:10,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:28:10,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:10,085 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:28:10,113 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-11-28 13:28:10,113 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 13:28:10,115 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:28:10,116 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:28:10,117 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:28:10,117 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlen_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_1) = -1*ULTIMATE.start_cstrlen_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_1 Supporting invariants [] [2018-11-28 13:28:10,170 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-28 13:28:10,175 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:28:10,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:10,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:28:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:10,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:28:10,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:28:10,255 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-28 13:28:10,256 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 4 states. [2018-11-28 13:28:10,318 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-28 13:28:10,319 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-28 13:28:10,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 13:28:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2018-11-28 13:28:10,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-28 13:28:10,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:28:10,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-28 13:28:10,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:28:10,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-28 13:28:10,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:28:10,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 111 transitions. [2018-11-28 13:28:10,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 13:28:10,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 27 states and 36 transitions. [2018-11-28 13:28:10,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-28 13:28:10,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-28 13:28:10,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2018-11-28 13:28:10,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:28:10,330 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-28 13:28:10,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2018-11-28 13:28:10,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-28 13:28:10,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 13:28:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2018-11-28 13:28:10,346 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-28 13:28:10,346 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-28 13:28:10,346 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 13:28:10,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2018-11-28 13:28:10,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 13:28:10,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:28:10,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:28:10,347 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:28:10,347 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:28:10,348 INFO L794 eck$LassoCheckResult]: Stem: 254#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 244#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 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);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~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;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 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;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 234#L568-4 [2018-11-28 13:28:10,348 INFO L796 eck$LassoCheckResult]: Loop: 234#L568-4 goto; 250#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 246#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 247#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 235#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 236#L551 assume 0 == cstrncmp_~n % 4294967296;cstrncmp_#res := 0; 248#L559 cstrstr_#t~ret16 := cstrncmp_#res; 239#L568-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 234#L568-4 [2018-11-28 13:28:10,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:10,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231857, now seen corresponding path program 1 times [2018-11-28 13:28:10,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:10,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:10,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:10,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:10,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:10,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:10,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1752516368, now seen corresponding path program 1 times [2018-11-28 13:28:10,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:10,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:10,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:10,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:10,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:28:10,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:10,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:28:10,414 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:28:10,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:28:10,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:28:10,417 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-28 13:28:10,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:10,455 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2018-11-28 13:28:10,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:28:10,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2018-11-28 13:28:10,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 13:28:10,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 32 transitions. [2018-11-28 13:28:10,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-28 13:28:10,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-28 13:28:10,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2018-11-28 13:28:10,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:28:10,458 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-28 13:28:10,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2018-11-28 13:28:10,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-28 13:28:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 13:28:10,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-11-28 13:28:10,460 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-28 13:28:10,460 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-28 13:28:10,460 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 13:28:10,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2018-11-28 13:28:10,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 13:28:10,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:28:10,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:28:10,461 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:28:10,462 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:28:10,462 INFO L794 eck$LassoCheckResult]: Stem: 318#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 316#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 317#L581 assume !(main_~length1~0 < 1); 299#L581-2 assume !(main_~length2~0 < 1); 300#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);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; 307#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;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; 308#L544-4 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;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 302#L568-4 [2018-11-28 13:28:10,462 INFO L796 eck$LassoCheckResult]: Loop: 302#L568-4 goto; 298#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 303#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 296#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 297#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 304#L551 assume !(0 == cstrncmp_~n % 4294967296); 321#L553-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 310#L554 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;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~mem10;havoc cstrncmp_#t~mem9;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset; 311#L559 cstrstr_#t~ret16 := cstrncmp_#res; 309#L568-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 302#L568-4 [2018-11-28 13:28:10,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:10,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231857, now seen corresponding path program 2 times [2018-11-28 13:28:10,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:10,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:10,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:10,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:10,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:10,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:10,482 INFO L82 PathProgramCache]: Analyzing trace with hash 542190293, now seen corresponding path program 1 times [2018-11-28 13:28:10,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:10,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:10,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:10,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:28:10,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:10,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:10,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1106695813, now seen corresponding path program 1 times [2018-11-28 13:28:10,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:10,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:10,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:10,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:10,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:28:10,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:10,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:28:10,804 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2018-11-28 13:28:10,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:28:10,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:28:10,857 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-28 13:28:10,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:10,919 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-11-28 13:28:10,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:28:10,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2018-11-28 13:28:10,920 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-28 13:28:10,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 41 transitions. [2018-11-28 13:28:10,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-28 13:28:10,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-28 13:28:10,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2018-11-28 13:28:10,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:28:10,921 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-28 13:28:10,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2018-11-28 13:28:10,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-28 13:28:10,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 13:28:10,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-28 13:28:10,923 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-28 13:28:10,923 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-28 13:28:10,923 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 13:28:10,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2018-11-28 13:28:10,923 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-28 13:28:10,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:28:10,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:28:10,924 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:28:10,924 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:28:10,924 INFO L794 eck$LassoCheckResult]: Stem: 399#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 397#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 398#L581 assume !(main_~length1~0 < 1); 378#L581-2 assume !(main_~length2~0 < 1); 379#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);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; 387#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;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; 388#L544-4 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;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 381#L568-4 goto; 377#L569-2 [2018-11-28 13:28:10,924 INFO L796 eck$LassoCheckResult]: Loop: 377#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 382#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 376#L569 assume !!(cstrstr_~sc~0 != cstrstr_~c~0); 377#L569-2 [2018-11-28 13:28:10,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:10,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2114547350, now seen corresponding path program 1 times [2018-11-28 13:28:10,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:10,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:10,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:10,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:10,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:10,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:10,939 INFO L82 PathProgramCache]: Analyzing trace with hash 71663, now seen corresponding path program 1 times [2018-11-28 13:28:10,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:10,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:10,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:10,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:10,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:10,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:10,944 INFO L82 PathProgramCache]: Analyzing trace with hash 194815290, now seen corresponding path program 1 times [2018-11-28 13:28:10,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:10,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:10,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:10,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:10,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:11,272 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2018-11-28 13:28:11,529 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2018-11-28 13:28:11,530 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:28:11,530 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:28:11,530 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:28:11,530 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:28:11,530 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:28:11,530 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:28:11,531 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:28:11,531 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:28:11,531 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-28 13:28:11,531 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:28:11,531 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:28:11,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,775 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2018-11-28 13:28:11,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:11,973 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2018-11-28 13:28:12,238 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:28:12,239 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:28:12,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:12,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:12,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:12,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:12,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:12,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:12,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:12,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:12,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:12,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:12,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:12,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:12,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:12,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:12,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:12,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:12,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:12,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:12,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:12,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:12,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:12,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:12,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:12,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:12,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:12,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:12,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:12,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:12,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:12,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:12,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:12,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:12,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:12,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:12,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:12,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:12,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:12,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:12,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:12,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:12,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:12,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:12,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:12,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:12,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:12,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:12,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:12,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:12,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:12,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:12,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:12,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:12,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:12,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:12,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:12,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:12,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:12,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:12,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:12,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:28:12,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:12,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:12,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:12,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:12,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:12,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:12,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:12,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:12,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:12,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:12,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:12,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:12,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:12,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:12,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:12,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:12,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:12,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:12,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:12,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:12,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:12,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:12,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:12,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:12,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:12,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:12,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:12,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:12,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:12,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:12,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:12,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:12,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:12,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:12,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:12,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:12,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:12,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:12,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:12,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:12,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:12,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:12,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:12,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:12,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:12,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:12,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:12,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:12,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:12,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:12,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:12,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:12,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:12,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:12,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:12,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:12,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-28 13:28:12,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:12,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:12,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:12,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:12,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:12,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:12,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:12,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:12,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:12,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:12,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:12,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:12,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:12,267 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:28:12,267 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:12,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:12,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:12,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:12,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:12,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:12,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:12,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:12,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:12,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:12,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:12,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:12,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:12,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:12,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:12,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:12,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:12,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:12,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:12,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:12,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:12,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:12,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:12,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:12,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:12,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:12,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:12,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:12,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:12,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:12,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:12,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:12,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:12,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:12,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:12,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:12,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:12,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:12,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:12,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:12,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:12,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:12,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:12,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:12,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:12,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:12,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:12,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-28 13:28:12,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:12,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:12,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:12,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:12,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:12,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:12,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:12,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:12,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-28 13:28:12,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:12,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:12,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:12,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:12,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:28:12,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:12,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:12,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:12,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:12,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:12,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:12,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:12,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:28:12,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:12,301 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:28:12,309 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 13:28:12,309 INFO L444 ModelExtractionUtils]: 54 out of 58 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 13:28:12,309 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:28:12,310 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:28:12,310 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:28:12,310 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-28 13:28:12,398 INFO L297 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2018-11-28 13:28:12,400 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:28:12,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:12,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:28:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:12,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:28:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:28:12,471 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-28 13:28:12,471 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-28 13:28:12,512 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-28 13:28:12,513 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-28 13:28:12,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 13:28:12,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-11-28 13:28:12,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-28 13:28:12,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:28:12,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 13:28:12,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:28:12,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-28 13:28:12,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:28:12,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2018-11-28 13:28:12,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:28:12,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 36 states and 42 transitions. [2018-11-28 13:28:12,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-28 13:28:12,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 13:28:12,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2018-11-28 13:28:12,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:28:12,516 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-28 13:28:12,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2018-11-28 13:28:12,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-28 13:28:12,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-28 13:28:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-28 13:28:12,524 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-28 13:28:12,524 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-28 13:28:12,524 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 13:28:12,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2018-11-28 13:28:12,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:28:12,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:28:12,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:28:12,525 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-28 13:28:12,525 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 13:28:12,526 INFO L794 eck$LassoCheckResult]: Stem: 646#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 644#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 645#L581 assume !(main_~length1~0 < 1); 621#L581-2 assume !(main_~length2~0 < 1); 622#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);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~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;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 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 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;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 624#L568-4 goto; 625#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 626#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 616#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 617#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 627#L551 assume !(0 == cstrncmp_~n % 4294967296); 650#L553-4 [2018-11-28 13:28:12,526 INFO L796 eck$LassoCheckResult]: Loop: 650#L553-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 637#L554 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;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); 629#L556 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset;havoc cstrncmp_#t~mem12; 630#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-28 13:28:12,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:12,526 INFO L82 PathProgramCache]: Analyzing trace with hash -912258627, now seen corresponding path program 1 times [2018-11-28 13:28:12,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:12,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:12,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:12,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:12,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:12,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:12,551 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 1 times [2018-11-28 13:28:12,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:12,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:12,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:12,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:12,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:12,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:12,561 INFO L82 PathProgramCache]: Analyzing trace with hash -599457521, now seen corresponding path program 1 times [2018-11-28 13:28:12,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:12,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:12,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:12,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:12,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:12,723 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-28 13:28:12,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:28:12,723 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_473e5f28-7308-4916-8f56-53a244d406a3/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:28:12,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:12,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:28:12,841 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-28 13:28:12,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:28:12,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-11-28 13:28:12,970 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2018-11-28 13:28:12,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 13:28:12,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:28:12,996 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 9 Second operand 12 states. [2018-11-28 13:28:13,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:13,123 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-11-28 13:28:13,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:28:13,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 83 transitions. [2018-11-28 13:28:13,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:28:13,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 41 states and 47 transitions. [2018-11-28 13:28:13,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 13:28:13,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 13:28:13,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2018-11-28 13:28:13,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:28:13,125 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-28 13:28:13,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2018-11-28 13:28:13,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-28 13:28:13,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 13:28:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-11-28 13:28:13,127 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-11-28 13:28:13,127 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-11-28 13:28:13,127 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 13:28:13,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2018-11-28 13:28:13,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:28:13,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:28:13,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:28:13,128 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-28 13:28:13,129 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 13:28:13,129 INFO L794 eck$LassoCheckResult]: Stem: 849#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 847#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 848#L581 assume !(main_~length1~0 < 1); 824#L581-2 assume !(main_~length2~0 < 1); 825#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);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~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;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 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 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 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;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 827#L568-4 goto; 828#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 829#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 819#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 820#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 830#L551 assume !(0 == cstrncmp_~n % 4294967296); 854#L553-4 [2018-11-28 13:28:13,129 INFO L796 eck$LassoCheckResult]: Loop: 854#L553-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 840#L554 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;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); 832#L556 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset;havoc cstrncmp_#t~mem12; 833#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-28 13:28:13,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:13,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1478230621, now seen corresponding path program 2 times [2018-11-28 13:28:13,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:13,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:13,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:13,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:13,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:13,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:13,148 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 2 times [2018-11-28 13:28:13,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:13,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:13,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:13,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:28:13,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:13,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:13,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1703636079, now seen corresponding path program 2 times [2018-11-28 13:28:13,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:13,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:13,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:13,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:28:13,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:13,928 WARN L180 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 185 [2018-11-28 13:28:14,336 WARN L180 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 141 [2018-11-28 13:28:14,338 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:28:14,338 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:28:14,338 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:28:14,338 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:28:14,338 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:28:14,338 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:28:14,338 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:28:14,338 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:28:14,338 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-28 13:28:14,338 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:28:14,338 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:28:14,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:14,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:14,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:14,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:14,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:14,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:14,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:14,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:14,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:14,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:14,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:14,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:14,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:14,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:14,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:14,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:14,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:14,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:14,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:14,896 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 132 [2018-11-28 13:28:15,027 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2018-11-28 13:28:15,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:15,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:15,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:15,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:15,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:15,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:15,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:15,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:15,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:15,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:15,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:15,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:15,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-28 13:28:15,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-28 13:28:15,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:15,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:15,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:15,303 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2018-11-28 13:28:15,702 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:28:15,702 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:28:15,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:15,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:15,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:15,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:15,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:15,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:15,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:15,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:15,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:15,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:15,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:15,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:15,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:15,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:15,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:15,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:15,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:15,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:15,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:15,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:15,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:15,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:15,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:15,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:15,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:15,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:15,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:15,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:15,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:15,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:15,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:15,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:15,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:15,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:15,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:15,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:15,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:15,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:28:15,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:15,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:15,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:15,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:15,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:15,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:15,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:15,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:15,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:15,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:15,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:15,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:15,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:15,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:15,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:15,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:15,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:15,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:15,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:15,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:15,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:15,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:15,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:15,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:15,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:15,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:15,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:15,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:15,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:15,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:15,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:15,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:15,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:15,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,739 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:28:15,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,741 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:28:15,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:15,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,748 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:28:15,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,748 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:28:15,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:15,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:15,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:28:15,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:15,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,756 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:28:15,756 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:28:15,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,758 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-28 13:28:15,758 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 13:28:15,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,768 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:28:15,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,770 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:28:15,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:15,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:15,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:28:15,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:15,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:15,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:28:15,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:15,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:15,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:28:15,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:15,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:15,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:15,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:15,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:15,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:15,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:15,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:28:15,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:15,870 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:28:15,902 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 13:28:15,902 INFO L444 ModelExtractionUtils]: 80 out of 85 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 13:28:15,902 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:28:15,903 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:28:15,903 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:28:15,903 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~s1.offset, v_rep(select #length ULTIMATE.start_cstrstr_#in~s.base)_1) = -1*ULTIMATE.start_cstrncmp_~s1.offset + 1*v_rep(select #length ULTIMATE.start_cstrstr_#in~s.base)_1 Supporting invariants [] [2018-11-28 13:28:16,083 INFO L297 tatePredicateManager]: 49 out of 51 supporting invariants were superfluous and have been removed [2018-11-28 13:28:16,087 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:28:16,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:16,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:28:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:16,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:28:16,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:28:16,188 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-28 13:28:16,188 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-28 13:28:16,248 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-28 13:28:16,250 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-28 13:28:16,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 13:28:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-11-28 13:28:16,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 22 letters. Loop has 5 letters. [2018-11-28 13:28:16,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:28:16,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 27 letters. Loop has 5 letters. [2018-11-28 13:28:16,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:28:16,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 22 letters. Loop has 10 letters. [2018-11-28 13:28:16,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:28:16,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 99 transitions. [2018-11-28 13:28:16,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:28:16,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 63 states and 74 transitions. [2018-11-28 13:28:16,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-28 13:28:16,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-28 13:28:16,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 74 transitions. [2018-11-28 13:28:16,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:28:16,255 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-11-28 13:28:16,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 74 transitions. [2018-11-28 13:28:16,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-11-28 13:28:16,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-28 13:28:16,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-11-28 13:28:16,257 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-28 13:28:16,258 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-28 13:28:16,258 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 13:28:16,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 63 transitions. [2018-11-28 13:28:16,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:28:16,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:28:16,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:28:16,259 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-28 13:28:16,259 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 13:28:16,259 INFO L794 eck$LassoCheckResult]: Stem: 1296#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1294#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 1295#L581 assume !(main_~length1~0 < 1); 1270#L581-2 assume !(main_~length2~0 < 1); 1271#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);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; 1283#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;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; 1284#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1304#L544-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1309#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; 1305#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1292#L544-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1293#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; 1300#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1290#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1291#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); 1272#L546 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 1273#L568-4 goto; 1274#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1275#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 1307#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1316#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 1313#L551 assume !(0 == cstrncmp_~n % 4294967296); 1314#L553-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 1310#L554 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;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~mem10;havoc cstrncmp_#t~mem9;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset; 1308#L559 cstrstr_#t~ret16 := cstrncmp_#res; 1285#L568-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 1286#L568-4 goto; 1269#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1276#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 1265#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1266#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 1277#L551 assume !(0 == cstrncmp_~n % 4294967296); 1301#L553-4 [2018-11-28 13:28:16,259 INFO L796 eck$LassoCheckResult]: Loop: 1301#L553-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 1287#L554 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;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); 1279#L556 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset;havoc cstrncmp_#t~mem12; 1280#L553-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 1297#L553-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 1301#L553-4 [2018-11-28 13:28:16,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:16,260 INFO L82 PathProgramCache]: Analyzing trace with hash -2051218895, now seen corresponding path program 1 times [2018-11-28 13:28:16,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:16,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:16,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:16,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:28:16,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:16,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:16,294 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 3 times [2018-11-28 13:28:16,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:16,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:16,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:16,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:16,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:16,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:16,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1369353957, now seen corresponding path program 1 times [2018-11-28 13:28:16,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:16,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:16,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:16,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:28:16,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:17,596 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 325 DAG size of output: 258 [2018-11-28 13:28:18,121 WARN L180 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 156 [2018-11-28 13:28:18,123 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:28:18,123 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:28:18,123 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:28:18,123 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:28:18,123 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:28:18,123 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:28:18,123 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:28:18,123 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:28:18,123 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2018-11-28 13:28:18,123 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:28:18,123 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:28:18,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:18,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:18,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:18,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:18,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:18,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:18,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:18,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:18,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:18,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:18,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:18,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:18,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:18,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:18,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:18,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:18,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:18,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:18,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:18,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:18,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:18,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:18,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:18,927 WARN L180 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 144 [2018-11-28 13:28:19,146 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2018-11-28 13:28:19,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:19,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:19,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:19,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:19,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:19,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:19,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:19,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:19,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:19,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:19,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:19,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:19,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:19,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:28:19,447 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2018-11-28 13:28:19,611 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-11-28 13:28:20,196 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2018-11-28 13:28:20,287 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:28:20,287 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:28:20,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:20,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:20,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:20,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:20,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:20,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:20,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:20,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:20,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:20,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:20,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:20,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:20,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:20,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:20,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:20,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:20,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:20,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:20,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:28:20,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:20,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:20,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:20,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:20,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:20,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:20,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:20,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:20,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:20,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:20,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:20,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:20,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:20,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:20,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:20,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:20,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:20,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:20,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:20,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:20,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:20,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:20,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:20,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:20,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:20,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:20,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:20,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:20,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:20,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:20,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:20,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:20,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:20,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:20,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:20,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:20,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:20,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:20,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:20,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:20,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:20,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:20,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:20,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:28:20,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:28:20,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:28:20,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,339 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:28:20,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,340 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:28:20,340 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:20,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:28:20,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:20,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,348 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:28:20,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,349 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:28:20,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:20,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:28:20,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:20,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:28:20,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:20,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:28:20,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:20,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:28:20,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:28:20,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:28:20,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:28:20,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:28:20,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:28:20,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:28:20,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:28:20,449 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:28:20,503 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-28 13:28:20,503 INFO L444 ModelExtractionUtils]: 76 out of 85 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 13:28:20,503 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:28:20,504 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:28:20,504 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:28:20,504 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_4, ULTIMATE.start_cstrncmp_~s2.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_4 - 1*ULTIMATE.start_cstrncmp_~s2.offset Supporting invariants [] [2018-11-28 13:28:20,856 INFO L297 tatePredicateManager]: 81 out of 84 supporting invariants were superfluous and have been removed [2018-11-28 13:28:20,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:28:20,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:20,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:28:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:20,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:28:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:28:20,944 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-28 13:28:20,944 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-28 13:28:20,966 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 61 states and 70 transitions. Complement of second has 7 states. [2018-11-28 13:28:20,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:28:20,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:28:20,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-28 13:28:20,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 32 letters. Loop has 5 letters. [2018-11-28 13:28:20,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:28:20,967 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:28:20,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:21,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:28:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:21,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:28:21,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:28:21,026 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-28 13:28:21,026 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-28 13:28:21,064 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 79 states and 93 transitions. Complement of second has 9 states. [2018-11-28 13:28:21,064 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-28 13:28:21,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:28:21,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2018-11-28 13:28:21,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 32 letters. Loop has 5 letters. [2018-11-28 13:28:21,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:28:21,065 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:28:21,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:21,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:28:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:21,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:28:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:28:21,131 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 2 loop predicates [2018-11-28 13:28:21,131 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-28 13:28:21,161 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 71 states and 80 transitions. Complement of second has 6 states. [2018-11-28 13:28:21,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:28:21,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:28:21,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2018-11-28 13:28:21,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 32 letters. Loop has 5 letters. [2018-11-28 13:28:21,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:28:21,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 37 letters. Loop has 5 letters. [2018-11-28 13:28:21,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:28:21,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 32 letters. Loop has 10 letters. [2018-11-28 13:28:21,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:28:21,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 80 transitions. [2018-11-28 13:28:21,167 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:28:21,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 0 states and 0 transitions. [2018-11-28 13:28:21,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 13:28:21,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 13:28:21,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 13:28:21,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:28:21,167 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:28:21,168 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:28:21,168 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:28:21,168 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 13:28:21,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:28:21,168 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:28:21,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 13:28:21,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 01:28:21 BoogieIcfgContainer [2018-11-28 13:28:21,172 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 13:28:21,172 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:28:21,172 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:28:21,173 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:28:21,173 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:28:08" (3/4) ... [2018-11-28 13:28:21,176 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 13:28:21,176 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:28:21,177 INFO L168 Benchmark]: Toolchain (without parser) took 13441.60 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 371.2 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -197.8 MB). Peak memory consumption was 173.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:28:21,177 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 974.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:28:21,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:28:21,178 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:28:21,179 INFO L168 Benchmark]: Boogie Preprocessor took 24.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:28:21,179 INFO L168 Benchmark]: RCFGBuilder took 310.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:28:21,179 INFO L168 Benchmark]: BuchiAutomizer took 12731.16 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 241.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -51.4 MB). Peak memory consumption was 190.3 MB. Max. memory is 11.5 GB. [2018-11-28 13:28:21,180 INFO L168 Benchmark]: Witness Printer took 3.62 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:28:21,182 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 974.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 310.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12731.16 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 241.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -51.4 MB). Peak memory consumption was 190.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.62 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 4 locations. One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[s] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s2 and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.7s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 11.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: 254 SDtfs, 301 SDslu, 517 SDs, 0 SdLazy, 207 SolverSat, 37 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 lsp47 div139 bol100 ite100 ukn100 eq170 hnf76 smp95 dnf141 smp87 tf100 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms 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...