./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_88561f25-a513-404b-bf8c-a9f888b92098/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_88561f25-a513-404b-bf8c-a9f888b92098/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_88561f25-a513-404b-bf8c-a9f888b92098/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_88561f25-a513-404b-bf8c-a9f888b92098/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_88561f25-a513-404b-bf8c-a9f888b92098/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_88561f25-a513-404b-bf8c-a9f888b92098/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-635dfa2 [2018-12-01 16:51:18,884 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 16:51:18,885 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 16:51:18,894 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 16:51:18,894 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 16:51:18,895 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 16:51:18,896 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 16:51:18,897 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 16:51:18,898 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 16:51:18,899 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 16:51:18,899 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 16:51:18,900 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 16:51:18,900 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 16:51:18,901 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 16:51:18,902 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 16:51:18,902 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 16:51:18,903 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 16:51:18,904 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 16:51:18,906 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 16:51:18,907 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 16:51:18,908 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 16:51:18,909 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 16:51:18,911 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 16:51:18,911 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 16:51:18,911 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 16:51:18,912 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 16:51:18,912 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 16:51:18,913 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 16:51:18,914 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 16:51:18,915 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 16:51:18,915 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 16:51:18,915 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 16:51:18,915 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 16:51:18,916 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 16:51:18,916 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 16:51:18,917 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 16:51:18,917 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_88561f25-a513-404b-bf8c-a9f888b92098/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-01 16:51:18,928 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 16:51:18,929 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 16:51:18,929 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 16:51:18,929 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 16:51:18,930 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 16:51:18,930 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 16:51:18,930 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 16:51:18,930 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 16:51:18,930 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 16:51:18,930 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 16:51:18,930 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 16:51:18,931 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 16:51:18,931 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 16:51:18,931 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 16:51:18,931 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 16:51:18,931 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 16:51:18,931 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 16:51:18,931 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 16:51:18,932 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 16:51:18,932 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 16:51:18,932 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 16:51:18,932 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 16:51:18,932 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 16:51:18,932 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 16:51:18,932 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 16:51:18,933 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 16:51:18,933 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 16:51:18,933 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 16:51:18,933 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 16:51:18,933 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 16:51:18,933 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 16:51:18,933 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 16:51:18,934 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_88561f25-a513-404b-bf8c-a9f888b92098/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-12-01 16:51:18,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 16:51:18,965 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 16:51:18,968 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 16:51:18,969 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 16:51:18,969 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 16:51:18,970 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_88561f25-a513-404b-bf8c-a9f888b92098/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-12-01 16:51:19,013 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_88561f25-a513-404b-bf8c-a9f888b92098/bin-2019/uautomizer/data/8fc67c551/c9560ff0c05c46529e6b878587b4eb01/FLAGd7659654e [2018-12-01 16:51:19,460 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 16:51:19,460 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_88561f25-a513-404b-bf8c-a9f888b92098/sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-12-01 16:51:19,466 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_88561f25-a513-404b-bf8c-a9f888b92098/bin-2019/uautomizer/data/8fc67c551/c9560ff0c05c46529e6b878587b4eb01/FLAGd7659654e [2018-12-01 16:51:19,474 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_88561f25-a513-404b-bf8c-a9f888b92098/bin-2019/uautomizer/data/8fc67c551/c9560ff0c05c46529e6b878587b4eb01 [2018-12-01 16:51:19,476 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 16:51:19,476 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 16:51:19,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 16:51:19,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 16:51:19,479 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 16:51:19,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:51:19" (1/1) ... [2018-12-01 16:51:19,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3263b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:51:19, skipping insertion in model container [2018-12-01 16:51:19,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:51:19" (1/1) ... [2018-12-01 16:51:19,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 16:51:19,510 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 16:51:19,660 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 16:51:19,698 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 16:51:19,728 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 16:51:19,753 INFO L195 MainTranslator]: Completed translation [2018-12-01 16:51:19,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:51:19 WrapperNode [2018-12-01 16:51:19,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 16:51:19,754 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 16:51:19,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 16:51:19,754 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 16:51:19,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:51:19" (1/1) ... [2018-12-01 16:51:19,772 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:51:19" (1/1) ... [2018-12-01 16:51:19,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 16:51:19,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 16:51:19,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 16:51:19,787 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 16:51:19,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:51:19" (1/1) ... [2018-12-01 16:51:19,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:51:19" (1/1) ... [2018-12-01 16:51:19,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:51:19" (1/1) ... [2018-12-01 16:51:19,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:51:19" (1/1) ... [2018-12-01 16:51:19,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:51:19" (1/1) ... [2018-12-01 16:51:19,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:51:19" (1/1) ... [2018-12-01 16:51:19,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:51:19" (1/1) ... [2018-12-01 16:51:19,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 16:51:19,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 16:51:19,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 16:51:19,803 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 16:51:19,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:51:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88561f25-a513-404b-bf8c-a9f888b92098/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-12-01 16:51:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 16:51:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 16:51:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 16:51:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 16:51:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 16:51:19,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 16:51:20,020 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 16:51:20,020 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-12-01 16:51:20,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:51:20 BoogieIcfgContainer [2018-12-01 16:51:20,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 16:51:20,021 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 16:51:20,021 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 16:51:20,025 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 16:51:20,025 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 16:51:20,025 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 04:51:19" (1/3) ... [2018-12-01 16:51:20,026 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a43b08b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 04:51:20, skipping insertion in model container [2018-12-01 16:51:20,026 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 16:51:20,026 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:51:19" (2/3) ... [2018-12-01 16:51:20,026 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a43b08b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 04:51:20, skipping insertion in model container [2018-12-01 16:51:20,026 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 16:51:20,026 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:51:20" (3/3) ... [2018-12-01 16:51:20,027 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-12-01 16:51:20,060 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 16:51:20,061 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 16:51:20,061 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 16:51:20,061 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 16:51:20,061 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 16:51:20,061 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 16:51:20,061 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 16:51:20,061 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 16:51:20,061 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 16:51:20,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-12-01 16:51:20,083 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-01 16:51:20,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 16:51:20,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 16:51:20,089 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-01 16:51:20,090 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 16:51:20,090 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 16:51:20,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-12-01 16:51:20,092 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-01 16:51:20,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 16:51:20,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 16:51:20,092 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-01 16:51:20,092 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 16:51:20,099 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-12-01 16:51:20,099 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-12-01 16:51:20,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:20,102 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2018-12-01 16:51:20,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:51:20,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:51:20,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:20,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:51:20,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:20,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:20,201 INFO L82 PathProgramCache]: Analyzing trace with hash 51799, now seen corresponding path program 1 times [2018-12-01 16:51:20,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:51:20,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:51:20,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:20,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:51:20,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:20,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:20,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1298288364, now seen corresponding path program 1 times [2018-12-01 16:51:20,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:51:20,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:51:20,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:20,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:51:20,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:20,533 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 107 [2018-12-01 16:51:20,628 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 16:51:20,628 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 16:51:20,629 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 16:51:20,629 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 16:51:20,629 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 16:51:20,629 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 16:51:20,629 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 16:51:20,629 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 16:51:20,630 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-12-01 16:51:20,630 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 16:51:20,630 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 16:51:20,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:20,887 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2018-12-01 16:51:21,234 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 16:51:21,237 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 16:51:21,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:21,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:21,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:21,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:21,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:21,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:21,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:21,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:21,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,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-12-01 16:51:21,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:21,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:21,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:21,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,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-12-01 16:51:21,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:21,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:21,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:21,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,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-12-01 16:51:21,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:21,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:21,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:21,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,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-12-01 16:51:21,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:51:21,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:21,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:21,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:21,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:21,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:21,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,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-12-01 16:51:21,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:21,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:21,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:21,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:21,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:21,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:21,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:21,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,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-12-01 16:51:21,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:21,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:21,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:21,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:21,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:21,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:21,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:21,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:21,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:21,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:21,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:21,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:21,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,264 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:51:21,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:21,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:21,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:21,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:21,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:21,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:21,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:21,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:21,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:21,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,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-12-01 16:51:21,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:21,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:21,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:21,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:21,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:21,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:21,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:21,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,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-12-01 16:51:21,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:21,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:21,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:21,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:21,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:21,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:21,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:21,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:21,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:21,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:21,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:21,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:21,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:21,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:21,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:21,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:21,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:21,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:21,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:21,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:21,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:21,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:21,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:21,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:21,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:21,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:21,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:21,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,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-12-01 16:51:21,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:21,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:21,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:21,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,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-12-01 16:51:21,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:51:21,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:21,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:21,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:51:21,296 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:21,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,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-12-01 16:51:21,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,300 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:51:21,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:21,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:21,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:51:21,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:21,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,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-12-01 16:51:21,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,311 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 16:51:21,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,312 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 16:51:21,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:21,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,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-12-01 16:51:21,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,316 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 16:51:21,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,317 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 16:51:21,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:21,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:21,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-12-01 16:51:21,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:21,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:21,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:21,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:21,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:51:21,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:21,349 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 16:51:21,371 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-12-01 16:51:21,372 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-01 16:51:21,373 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 16:51:21,374 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 16:51:21,374 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 16:51:21,374 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-12-01 16:51:21,406 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-12-01 16:51:21,411 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 16:51:21,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:51:21,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:51:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:51:21,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:51:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:51:21,496 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-12-01 16:51:21,497 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 4 states. [2018-12-01 16:51:21,557 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-12-01 16:51:21,557 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-12-01 16:51:21,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 16:51:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2018-12-01 16:51:21,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 6 letters. Loop has 3 letters. [2018-12-01 16:51:21,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:51:21,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 9 letters. Loop has 3 letters. [2018-12-01 16:51:21,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:51:21,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 6 letters. Loop has 6 letters. [2018-12-01 16:51:21,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:51:21,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 111 transitions. [2018-12-01 16:51:21,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-01 16:51:21,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 27 states and 36 transitions. [2018-12-01 16:51:21,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-01 16:51:21,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-01 16:51:21,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2018-12-01 16:51:21,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 16:51:21,567 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-12-01 16:51:21,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2018-12-01 16:51:21,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-01 16:51:21,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-01 16:51:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2018-12-01 16:51:21,582 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-12-01 16:51:21,582 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-12-01 16:51:21,582 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 16:51:21,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2018-12-01 16:51:21,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-01 16:51:21,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 16:51:21,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 16:51:21,583 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:51:21,583 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:51:21,583 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-12-01 16:51:21,584 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~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 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-12-01 16:51:21,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:21,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231857, now seen corresponding path program 1 times [2018-12-01 16:51:21,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:51:21,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:51:21,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:21,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:51:21,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:21,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:21,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1752516368, now seen corresponding path program 1 times [2018-12-01 16:51:21,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:51:21,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:51:21,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:21,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:51:21,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:51:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:51:21,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:51:21,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:51:21,644 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 16:51:21,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 16:51:21,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 16:51:21,646 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-01 16:51:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:51:21,662 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2018-12-01 16:51:21,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 16:51:21,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2018-12-01 16:51:21,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-12-01 16:51:21,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 32 transitions. [2018-12-01 16:51:21,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-01 16:51:21,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-01 16:51:21,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2018-12-01 16:51:21,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 16:51:21,664 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-12-01 16:51:21,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2018-12-01 16:51:21,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-01 16:51:21,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-01 16:51:21,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-12-01 16:51:21,665 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-12-01 16:51:21,665 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-12-01 16:51:21,665 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 16:51:21,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2018-12-01 16:51:21,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-12-01 16:51:21,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 16:51:21,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 16:51:21,666 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:51:21,666 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:51:21,667 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-12-01 16:51:21,667 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~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 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~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~mem6;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~pre8.base, cstrncmp_#t~pre8.offset;havoc cstrncmp_#t~mem9;havoc cstrncmp_#t~mem10; 311#L559 cstrstr_#t~ret16 := cstrncmp_#res; 309#L568-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 302#L568-4 [2018-12-01 16:51:21,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:21,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231857, now seen corresponding path program 2 times [2018-12-01 16:51:21,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:51:21,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:51:21,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:21,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:51:21,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:21,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:21,687 INFO L82 PathProgramCache]: Analyzing trace with hash 542190293, now seen corresponding path program 1 times [2018-12-01 16:51:21,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:51:21,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:51:21,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:21,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 16:51:21,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:21,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:21,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1106695813, now seen corresponding path program 1 times [2018-12-01 16:51:21,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:51:21,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:51:21,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:21,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:51:21,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:51:21,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:51:21,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:51:21,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 16:51:21,938 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2018-12-01 16:51:21,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 16:51:21,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 16:51:21,975 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-12-01 16:51:22,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:51:22,021 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-12-01 16:51:22,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 16:51:22,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2018-12-01 16:51:22,022 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-12-01 16:51:22,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 41 transitions. [2018-12-01 16:51:22,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-01 16:51:22,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-01 16:51:22,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2018-12-01 16:51:22,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 16:51:22,022 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-12-01 16:51:22,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2018-12-01 16:51:22,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-12-01 16:51:22,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-01 16:51:22,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-12-01 16:51:22,024 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-12-01 16:51:22,024 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-12-01 16:51:22,024 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 16:51:22,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2018-12-01 16:51:22,024 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-12-01 16:51:22,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 16:51:22,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 16:51:22,025 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:51:22,025 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 16:51:22,025 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-12-01 16:51:22,025 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~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 376#L569 assume !!(cstrstr_~sc~0 != cstrstr_~c~0); 377#L569-2 [2018-12-01 16:51:22,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:22,025 INFO L82 PathProgramCache]: Analyzing trace with hash 2114547350, now seen corresponding path program 1 times [2018-12-01 16:51:22,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:51:22,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:51:22,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:22,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:51:22,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:22,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:22,036 INFO L82 PathProgramCache]: Analyzing trace with hash 71663, now seen corresponding path program 1 times [2018-12-01 16:51:22,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:51:22,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:51:22,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:22,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:51:22,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:22,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:22,040 INFO L82 PathProgramCache]: Analyzing trace with hash 194815290, now seen corresponding path program 1 times [2018-12-01 16:51:22,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:51:22,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:51:22,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:22,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:51:22,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:22,324 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2018-12-01 16:51:22,578 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2018-12-01 16:51:22,580 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 16:51:22,580 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 16:51:22,580 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 16:51:22,580 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 16:51:22,580 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 16:51:22,580 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 16:51:22,580 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 16:51:22,580 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 16:51:22,580 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-12-01 16:51:22,581 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 16:51:22,581 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 16:51:22,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:22,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:22,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:22,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:22,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:22,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:22,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:22,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:22,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:22,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:22,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:22,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:22,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:22,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:22,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:22,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:22,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:22,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:22,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:22,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:22,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:22,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:22,878 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2018-12-01 16:51:22,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:22,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:23,312 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 16:51:23,313 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 16:51:23,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-12-01 16:51:23,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:23,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:23,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:23,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:23,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:23,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:23,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:23,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:23,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-12-01 16:51:23,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:23,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:23,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:23,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:23,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:23,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:23,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:23,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:23,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-12-01 16:51:23,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:23,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:23,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:23,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:23,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:23,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:23,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:23,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:23,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:23,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:23,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:23,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:23,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:23,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:23,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:23,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:23,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:23,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-12-01 16:51:23,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:23,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:23,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:23,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:23,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:23,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:23,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:23,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:23,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-12-01 16:51:23,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:23,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:23,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:23,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:23,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:23,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:23,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:23,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:23,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:23,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:23,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:23,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:23,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:23,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:51:23,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:23,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:23,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:23,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:23,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:23,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:23,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:23,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:23,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:23,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:23,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:23,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:23,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:23,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:23,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:23,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:23,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:23,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:23,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:23,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:23,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-12-01 16:51:23,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:23,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:23,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:23,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:23,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:23,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:23,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:23,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:23,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-12-01 16:51:23,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:23,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:23,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:23,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:23,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:23,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:23,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:23,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:23,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-12-01 16:51:23,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:23,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:23,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:23,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:23,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:23,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:23,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:23,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:23,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:23,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:23,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:23,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:23,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:23,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:23,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:23,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:23,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:23,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-12-01 16:51:23,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:23,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:23,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:23,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:23,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:23,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:23,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:23,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:23,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-12-01 16:51:23,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:23,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:23,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:23,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:23,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:51:23,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:23,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:23,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-12-01 16:51:23,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:23,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:23,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:23,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:23,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:23,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:23,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:23,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:23,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:23,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:23,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:23,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:23,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:23,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:23,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:23,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:23,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:23,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:23,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:23,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:23,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:23,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:23,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:23,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:23,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:23,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:23,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:23,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:23,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:23,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:23,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:23,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:23,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:23,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:23,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:23,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:23,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:23,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:23,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:23,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:23,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:23,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:23,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:23,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:23,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:23,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:23,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:23,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:23,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:23,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:23,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:23,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:23,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:23,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:23,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:23,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:23,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:23,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:23,352 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:51:23,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:23,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:23,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-12-01 16:51:23,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:23,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:23,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:23,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:23,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:51:23,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:23,375 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 16:51:23,383 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 16:51:23,383 INFO L444 ModelExtractionUtils]: 54 out of 58 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 16:51:23,383 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 16:51:23,384 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 16:51:23,384 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 16:51:23,384 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-12-01 16:51:23,434 INFO L297 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2018-12-01 16:51:23,436 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 16:51:23,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:51:23,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:51:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:51:23,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:51:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:51:23,480 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-12-01 16:51:23,480 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-12-01 16:51:23,505 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-12-01 16:51:23,506 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-12-01 16:51:23,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 16:51:23,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-12-01 16:51:23,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-01 16:51:23,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:51:23,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-01 16:51:23,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:51:23,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 11 letters. Loop has 6 letters. [2018-12-01 16:51:23,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:51:23,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2018-12-01 16:51:23,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 16:51:23,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 36 states and 42 transitions. [2018-12-01 16:51:23,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-01 16:51:23,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-01 16:51:23,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2018-12-01 16:51:23,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 16:51:23,508 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-12-01 16:51:23,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2018-12-01 16:51:23,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-01 16:51:23,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-01 16:51:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-12-01 16:51:23,509 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-12-01 16:51:23,509 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-12-01 16:51:23,510 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 16:51:23,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2018-12-01 16:51:23,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 16:51:23,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 16:51:23,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 16:51:23,510 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-12-01 16:51:23,510 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-01 16:51:23,510 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~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 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-12-01 16:51:23,511 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~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~mem6;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~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 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-12-01 16:51:23,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:23,511 INFO L82 PathProgramCache]: Analyzing trace with hash -912258627, now seen corresponding path program 1 times [2018-12-01 16:51:23,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:51:23,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:51:23,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:23,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:51:23,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:23,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:23,527 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 1 times [2018-12-01 16:51:23,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:51:23,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:51:23,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:23,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:51:23,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:23,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:23,535 INFO L82 PathProgramCache]: Analyzing trace with hash -599457521, now seen corresponding path program 1 times [2018-12-01 16:51:23,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:51:23,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:51:23,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:23,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:51:23,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:51:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:51:23,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 16:51:23,675 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88561f25-a513-404b-bf8c-a9f888b92098/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-12-01 16:51:23,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:51:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:51:23,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:51:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:51:23,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 16:51:23,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-12-01 16:51:23,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 16:51:23,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-12-01 16:51:23,853 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 9 Second operand 12 states. [2018-12-01 16:51:23,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:51:23,937 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-12-01 16:51:23,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 16:51:23,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 83 transitions. [2018-12-01 16:51:23,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 16:51:23,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 41 states and 47 transitions. [2018-12-01 16:51:23,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-01 16:51:23,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-01 16:51:23,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2018-12-01 16:51:23,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 16:51:23,939 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-12-01 16:51:23,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2018-12-01 16:51:23,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-12-01 16:51:23,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-01 16:51:23,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-12-01 16:51:23,940 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-12-01 16:51:23,940 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-12-01 16:51:23,940 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 16:51:23,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2018-12-01 16:51:23,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 16:51:23,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 16:51:23,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 16:51:23,941 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-12-01 16:51:23,941 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-01 16:51:23,941 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~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 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-12-01 16:51:23,942 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~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~mem6;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~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 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-12-01 16:51:23,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:23,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1478230621, now seen corresponding path program 2 times [2018-12-01 16:51:23,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:51:23,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:51:23,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:23,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:51:23,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:23,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:23,957 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 2 times [2018-12-01 16:51:23,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:51:23,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:51:23,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:23,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 16:51:23,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:23,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:23,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1703636079, now seen corresponding path program 2 times [2018-12-01 16:51:23,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:51:23,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:51:23,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:23,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 16:51:23,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:24,639 WARN L180 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 185 [2018-12-01 16:51:25,244 WARN L180 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 141 [2018-12-01 16:51:25,247 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 16:51:25,247 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 16:51:25,247 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 16:51:25,247 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 16:51:25,248 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 16:51:25,248 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 16:51:25,248 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 16:51:25,248 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 16:51:25,248 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-12-01 16:51:25,248 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 16:51:25,248 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 16:51:25,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-12-01 16:51:25,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:25,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:25,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:25,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-12-01 16:51:25,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-12-01 16:51:25,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:25,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:25,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:25,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:25,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:25,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:25,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:25,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:25,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:25,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-12-01 16:51:25,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-12-01 16:51:25,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:25,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:25,898 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 132 [2018-12-01 16:51:26,051 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2018-12-01 16:51:26,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:26,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:26,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:26,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:26,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:26,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:26,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:26,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:26,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:26,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:26,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:26,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:26,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:26,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:26,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:26,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:26,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:26,369 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2018-12-01 16:51:26,789 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 16:51:26,789 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 16:51:26,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:26,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:26,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:26,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:26,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:26,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:26,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:26,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:26,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:26,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:26,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:26,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:26,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:26,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:26,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:26,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:26,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:26,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:26,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:26,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:26,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:26,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:26,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:26,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:26,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:26,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:26,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:26,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:26,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:26,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:26,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:26,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:26,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:26,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:26,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:26,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:26,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:26,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:51:26,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:26,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:26,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:26,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:26,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:26,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:26,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:26,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:26,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:26,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:26,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:26,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:26,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:26,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:26,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:26,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:26,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:26,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:26,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:26,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:26,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:26,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:26,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:26,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:26,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:26,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:26,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:26,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:26,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:26,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:26,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:26,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:26,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:26,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,819 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 16:51:26,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,821 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 16:51:26,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:26,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,827 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 16:51:26,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,828 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 16:51:26,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:26,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:26,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:51:26,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:26,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,835 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 16:51:26,835 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 16:51:26,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,837 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-01 16:51:26,837 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-01 16:51:26,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,846 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 16:51:26,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,848 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 16:51:26,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:26,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:26,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:51:26,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:26,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:26,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:51:26,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:26,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:26,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:51:26,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:26,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:26,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:26,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:26,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:26,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:26,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:26,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:51:26,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:26,917 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 16:51:26,937 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-01 16:51:26,937 INFO L444 ModelExtractionUtils]: 80 out of 85 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-01 16:51:26,937 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 16:51:26,938 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 16:51:26,938 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 16:51:26,938 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrstr_#in~s.base)_1, ULTIMATE.start_cstrncmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrstr_#in~s.base)_1 - 1*ULTIMATE.start_cstrncmp_~s1.offset Supporting invariants [] [2018-12-01 16:51:27,101 INFO L297 tatePredicateManager]: 49 out of 51 supporting invariants were superfluous and have been removed [2018-12-01 16:51:27,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 16:51:27,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:51:27,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:51:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:51:27,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:51:27,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:51:27,178 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-12-01 16:51:27,179 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-12-01 16:51:27,218 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-12-01 16:51:27,219 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-12-01 16:51:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-01 16:51:27,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-12-01 16:51:27,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 22 letters. Loop has 5 letters. [2018-12-01 16:51:27,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:51:27,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 27 letters. Loop has 5 letters. [2018-12-01 16:51:27,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:51:27,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 22 letters. Loop has 10 letters. [2018-12-01 16:51:27,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:51:27,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 99 transitions. [2018-12-01 16:51:27,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 16:51:27,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 63 states and 74 transitions. [2018-12-01 16:51:27,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-01 16:51:27,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-12-01 16:51:27,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 74 transitions. [2018-12-01 16:51:27,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 16:51:27,222 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-12-01 16:51:27,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 74 transitions. [2018-12-01 16:51:27,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-12-01 16:51:27,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-01 16:51:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-12-01 16:51:27,224 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-12-01 16:51:27,224 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-12-01 16:51:27,224 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-01 16:51:27,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 63 transitions. [2018-12-01 16:51:27,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 16:51:27,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 16:51:27,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 16:51:27,225 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-12-01 16:51:27,225 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-01 16:51:27,226 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~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 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~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~mem6;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~pre8.base, cstrncmp_#t~pre8.offset;havoc cstrncmp_#t~mem9;havoc cstrncmp_#t~mem10; 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~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 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-12-01 16:51:27,226 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~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~mem6;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~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 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-12-01 16:51:27,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:27,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2051218895, now seen corresponding path program 1 times [2018-12-01 16:51:27,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:51:27,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:51:27,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:27,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 16:51:27,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:27,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:27,258 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 3 times [2018-12-01 16:51:27,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:51:27,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:51:27,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:27,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:51:27,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:27,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:27,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1369353957, now seen corresponding path program 1 times [2018-12-01 16:51:27,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:51:27,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:51:27,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:27,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 16:51:27,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:51:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:51:28,558 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 325 DAG size of output: 258 [2018-12-01 16:51:29,078 WARN L180 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 156 [2018-12-01 16:51:29,080 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 16:51:29,080 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 16:51:29,080 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 16:51:29,080 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 16:51:29,080 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 16:51:29,080 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 16:51:29,080 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 16:51:29,080 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 16:51:29,080 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2018-12-01 16:51:29,081 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 16:51:29,081 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 16:51:29,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:29,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:29,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:29,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:29,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:29,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:29,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:29,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:29,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:29,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:29,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:29,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:29,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:29,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:29,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:29,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:29,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:29,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:29,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:29,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:29,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:29,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:29,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:30,107 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 144 [2018-12-01 16:51:30,323 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2018-12-01 16:51:30,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:30,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:30,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:30,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:30,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:30,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:30,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:30,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:30,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:30,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:30,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:30,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:30,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:30,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:51:30,576 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2018-12-01 16:51:30,725 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-12-01 16:51:31,398 WARN L180 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2018-12-01 16:51:31,526 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 16:51:31,526 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 16:51:31,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:31,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:31,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:31,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:31,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:31,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:31,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:31,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:31,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:31,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:31,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:31,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:31,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:31,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:31,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:31,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:31,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:31,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:31,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:51:31,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:31,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:31,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:31,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:31,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:31,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:31,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:31,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:31,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:31,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:31,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:31,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:31,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:31,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:31,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:31,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:31,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:31,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:31,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:31,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:31,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:31,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:31,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:31,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:31,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:31,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:31,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:31,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:31,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:31,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:31,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:31,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:31,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:31,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:31,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:31,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:31,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:31,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:31,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:31,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:31,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:31,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:31,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:31,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:51:31,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:51:31,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:51:31,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,555 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:51:31,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:31,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,558 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 16:51:31,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,558 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 16:51:31,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:31,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,560 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 16:51:31,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,560 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 16:51:31,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:31,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:51:31,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:31,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:51:31,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:31,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:51:31,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:31,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:51:31,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:51:31,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:51:31,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:51:31,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:51:31,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:51:31,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:51:31,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:51:31,609 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 16:51:31,646 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-01 16:51:31,646 INFO L444 ModelExtractionUtils]: 76 out of 85 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-01 16:51:31,646 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 16:51:31,647 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 16:51:31,647 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 16:51:31,647 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~s2.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_4) = -1*ULTIMATE.start_cstrncmp_~s2.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_4 Supporting invariants [] [2018-12-01 16:51:32,011 INFO L297 tatePredicateManager]: 81 out of 84 supporting invariants were superfluous and have been removed [2018-12-01 16:51:32,014 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 16:51:32,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:51:32,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:51:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:51:32,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:51:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:51:32,079 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-12-01 16:51:32,079 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-12-01 16:51:32,103 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-12-01 16:51:32,104 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-12-01 16:51:32,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 16:51:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-12-01 16:51:32,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 32 letters. Loop has 5 letters. [2018-12-01 16:51:32,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:51:32,104 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 16:51:32,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:51:32,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:51:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:51:32,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:51:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:51:32,163 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-12-01 16:51:32,163 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-12-01 16:51:32,200 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-12-01 16:51:32,200 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-12-01 16:51:32,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 16:51:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2018-12-01 16:51:32,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 32 letters. Loop has 5 letters. [2018-12-01 16:51:32,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:51:32,201 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 16:51:32,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:51:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:51:32,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:51:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:51:32,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:51:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:51:32,270 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-12-01 16:51:32,270 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-12-01 16:51:32,298 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-12-01 16:51:32,298 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-12-01 16:51:32,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 16:51:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2018-12-01 16:51:32,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 32 letters. Loop has 5 letters. [2018-12-01 16:51:32,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:51:32,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 37 letters. Loop has 5 letters. [2018-12-01 16:51:32,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:51:32,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 32 letters. Loop has 10 letters. [2018-12-01 16:51:32,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:51:32,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 80 transitions. [2018-12-01 16:51:32,300 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 16:51:32,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 0 states and 0 transitions. [2018-12-01 16:51:32,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 16:51:32,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 16:51:32,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 16:51:32,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 16:51:32,300 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 16:51:32,300 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 16:51:32,300 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 16:51:32,300 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-01 16:51:32,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 16:51:32,300 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 16:51:32,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 16:51:32,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 04:51:32 BoogieIcfgContainer [2018-12-01 16:51:32,304 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 16:51:32,305 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 16:51:32,305 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 16:51:32,305 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 16:51:32,305 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:51:20" (3/4) ... [2018-12-01 16:51:32,307 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 16:51:32,307 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 16:51:32,308 INFO L168 Benchmark]: Toolchain (without parser) took 12831.69 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 497.0 MB). Free memory was 957.1 MB in the beginning and 1.4 GB in the end (delta: -428.5 MB). Peak memory consumption was 68.5 MB. Max. memory is 11.5 GB. [2018-12-01 16:51:32,308 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 16:51:32,308 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-12-01 16:51:32,309 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 16:51:32,309 INFO L168 Benchmark]: Boogie Preprocessor took 16.61 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-01 16:51:32,309 INFO L168 Benchmark]: RCFGBuilder took 217.26 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-01 16:51:32,309 INFO L168 Benchmark]: BuchiAutomizer took 12283.52 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 357.0 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -293.2 MB). Peak memory consumption was 63.9 MB. Max. memory is 11.5 GB. [2018-12-01 16:51:32,310 INFO L168 Benchmark]: Witness Printer took 2.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 16:51:32,311 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 276.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.61 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 217.26 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12283.52 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 357.0 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -293.2 MB). Peak memory consumption was 63.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -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 unknown-#length-unknown[s] + -1 * s1 and consists of 6 locations. One nondeterministic module has affine ranking function -1 * s2 + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] 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.2s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 11.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. 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: 10ms 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...