./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_23cce6d3-9896-41b0-8162-9dd733de82a5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_23cce6d3-9896-41b0-8162-9dd733de82a5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_23cce6d3-9896-41b0-8162-9dd733de82a5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_23cce6d3-9896-41b0-8162-9dd733de82a5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_23cce6d3-9896-41b0-8162-9dd733de82a5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_23cce6d3-9896-41b0-8162-9dd733de82a5/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 0116566dfd4e4e63b59200ee97d098541aa6c54d ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 15:27:18,195 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:27:18,196 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:27:18,203 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:27:18,203 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:27:18,204 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:27:18,204 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:27:18,205 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:27:18,207 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:27:18,207 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:27:18,208 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:27:18,208 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:27:18,209 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:27:18,209 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:27:18,210 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:27:18,211 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:27:18,211 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:27:18,212 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:27:18,214 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:27:18,215 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:27:18,216 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:27:18,216 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:27:18,218 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:27:18,218 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:27:18,218 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:27:18,219 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:27:18,220 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:27:18,220 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:27:18,221 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:27:18,222 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:27:18,222 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:27:18,222 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:27:18,222 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:27:18,222 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:27:18,223 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:27:18,224 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:27:18,224 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_23cce6d3-9896-41b0-8162-9dd733de82a5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 15:27:18,235 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:27:18,235 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:27:18,236 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 15:27:18,236 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 15:27:18,236 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 15:27:18,237 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 15:27:18,237 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 15:27:18,237 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 15:27:18,237 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 15:27:18,237 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 15:27:18,237 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 15:27:18,237 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:27:18,238 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:27:18,238 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 15:27:18,238 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:27:18,238 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:27:18,238 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:27:18,238 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 15:27:18,238 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 15:27:18,238 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 15:27:18,239 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:27:18,239 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:27:18,239 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 15:27:18,239 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:27:18,239 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 15:27:18,239 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:27:18,239 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:27:18,239 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 15:27:18,240 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:27:18,240 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 15:27:18,240 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 15:27:18,241 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 15:27:18,241 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_23cce6d3-9896-41b0-8162-9dd733de82a5/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 -> 0116566dfd4e4e63b59200ee97d098541aa6c54d [2018-11-18 15:27:18,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:27:18,271 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:27:18,273 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:27:18,274 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:27:18,274 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:27:18,275 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_23cce6d3-9896-41b0-8162-9dd733de82a5/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-11-18 15:27:18,311 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_23cce6d3-9896-41b0-8162-9dd733de82a5/bin-2019/uautomizer/data/177044e76/95396a9e0607482da8f512d612877245/FLAGdf7f1d3e0 [2018-11-18 15:27:18,740 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:27:18,740 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_23cce6d3-9896-41b0-8162-9dd733de82a5/sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-11-18 15:27:18,747 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_23cce6d3-9896-41b0-8162-9dd733de82a5/bin-2019/uautomizer/data/177044e76/95396a9e0607482da8f512d612877245/FLAGdf7f1d3e0 [2018-11-18 15:27:18,755 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_23cce6d3-9896-41b0-8162-9dd733de82a5/bin-2019/uautomizer/data/177044e76/95396a9e0607482da8f512d612877245 [2018-11-18 15:27:18,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:27:18,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:27:18,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:27:18,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:27:18,762 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:27:18,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:27:18" (1/1) ... [2018-11-18 15:27:18,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ee2369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:18, skipping insertion in model container [2018-11-18 15:27:18,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:27:18" (1/1) ... [2018-11-18 15:27:18,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:27:18,802 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:27:18,992 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:27:18,999 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:27:19,061 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:27:19,092 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:27:19,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:19 WrapperNode [2018-11-18 15:27:19,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:27:19,093 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:27:19,093 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:27:19,094 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:27:19,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:19" (1/1) ... [2018-11-18 15:27:19,111 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:19" (1/1) ... [2018-11-18 15:27:19,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:27:19,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:27:19,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:27:19,124 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:27:19,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:19" (1/1) ... [2018-11-18 15:27:19,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:19" (1/1) ... [2018-11-18 15:27:19,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:19" (1/1) ... [2018-11-18 15:27:19,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:19" (1/1) ... [2018-11-18 15:27:19,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:19" (1/1) ... [2018-11-18 15:27:19,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:19" (1/1) ... [2018-11-18 15:27:19,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:19" (1/1) ... [2018-11-18 15:27:19,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:27:19,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:27:19,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:27:19,140 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:27:19,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_23cce6d3-9896-41b0-8162-9dd733de82a5/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:27:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 15:27:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 15:27:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 15:27:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 15:27:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:27:19,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:27:19,322 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:27:19,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:27:19 BoogieIcfgContainer [2018-11-18 15:27:19,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:27:19,323 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 15:27:19,323 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 15:27:19,326 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 15:27:19,326 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:27:19,327 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 03:27:18" (1/3) ... [2018-11-18 15:27:19,327 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76ecd9cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:27:19, skipping insertion in model container [2018-11-18 15:27:19,328 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:27:19,328 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:19" (2/3) ... [2018-11-18 15:27:19,328 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76ecd9cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:27:19, skipping insertion in model container [2018-11-18 15:27:19,328 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:27:19,328 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:27:19" (3/3) ... [2018-11-18 15:27:19,330 INFO L375 chiAutomizerObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-11-18 15:27:19,363 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 15:27:19,363 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 15:27:19,363 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 15:27:19,364 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 15:27:19,364 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:27:19,364 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:27:19,364 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 15:27:19,364 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:27:19,364 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 15:27:19,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 15:27:19,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 15:27:19,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:27:19,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:27:19,396 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 15:27:19,396 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 15:27:19,396 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 15:27:19,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 15:27:19,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 15:27:19,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:27:19,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:27:19,399 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 15:27:19,399 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 15:27:19,405 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 3#L558true assume !(main_~length1~0 < 1); 5#L558-2true assume !(main_~length2~0 < 1); 19#L561-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);assume { :begin_inline_substring } true;substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 17#L543-4true [2018-11-18 15:27:19,406 INFO L796 eck$LassoCheckResult]: Loop: 17#L543-4true assume true; 10#L543-1true call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 13#L543-2true assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 14#L546-6true assume !true; 18#L546-7true call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 16#L550true assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 17#L543-4true [2018-11-18 15:27:19,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:19,411 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-18 15:27:19,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:27:19,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:27:19,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:19,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:27:19,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:19,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:19,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1451670811, now seen corresponding path program 1 times [2018-11-18 15:27:19,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:27:19,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:27:19,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:19,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:27:19,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:27:19,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:27:19,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 15:27:19,541 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:27:19,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 15:27:19,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 15:27:19,552 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-18 15:27:19,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:27:19,558 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-11-18 15:27:19,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 15:27:19,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2018-11-18 15:27:19,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 15:27:19,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 18 transitions. [2018-11-18 15:27:19,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 15:27:19,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 15:27:19,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2018-11-18 15:27:19,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:27:19,567 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-18 15:27:19,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2018-11-18 15:27:19,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-18 15:27:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 15:27:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-11-18 15:27:19,587 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-18 15:27:19,587 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-18 15:27:19,587 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 15:27:19,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-11-18 15:27:19,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 15:27:19,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:27:19,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:27:19,588 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 15:27:19,588 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:27:19,589 INFO L794 eck$LassoCheckResult]: Stem: 57#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 52#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 46#L558 assume !(main_~length1~0 < 1); 47#L558-2 assume !(main_~length2~0 < 1); 48#L561-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);assume { :begin_inline_substring } true;substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 59#L543-4 [2018-11-18 15:27:19,589 INFO L796 eck$LassoCheckResult]: Loop: 59#L543-4 assume true; 53#L543-1 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 54#L543-2 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 56#L546-6 assume true; 49#L546-1 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 50#L546-2 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 51#L546-4 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6; 55#L546-7 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 58#L550 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 59#L543-4 [2018-11-18 15:27:19,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:19,589 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-18 15:27:19,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:27:19,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:27:19,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:19,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:27:19,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:19,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:19,613 INFO L82 PathProgramCache]: Analyzing trace with hash 255671460, now seen corresponding path program 1 times [2018-11-18 15:27:19,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:27:19,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:27:19,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:19,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:27:19,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:19,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:19,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1738243327, now seen corresponding path program 1 times [2018-11-18 15:27:19,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:27:19,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:27:19,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:19,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:27:19,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:19,838 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2018-11-18 15:27:20,037 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-11-18 15:27:20,110 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:27:20,111 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:27:20,111 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:27:20,111 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:27:20,111 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:27:20,112 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:27:20,112 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:27:20,112 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:27:20,112 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-18 15:27:20,112 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:27:20,112 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:27:20,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:20,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:20,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:20,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:20,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:20,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:20,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:20,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:20,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:20,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:20,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:20,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:20,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:20,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:20,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:20,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:20,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:20,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:20,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:20,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:20,792 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:27:20,796 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:27:20,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-11-18 15:27:20,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:20,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:20,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:20,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:20,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:20,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:20,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:20,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:20,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:20,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:20,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:20,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:20,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:20,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-11-18 15:27:20,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:20,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:20,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:20,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:20,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:20,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:20,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:20,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:20,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:20,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:20,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:20,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:20,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:20,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:20,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:20,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,814 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:20,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:20,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:20,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-11-18 15:27:20,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:20,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:20,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:20,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:20,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:20,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:20,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:20,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:20,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:20,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:20,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:20,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:20,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:20,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:20,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:20,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:20,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:20,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:20,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:20,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:20,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:20,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:20,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:20,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:20,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:20,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:20,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:20,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:20,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:20,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:20,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:20,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:20,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:20,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:20,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:20,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:20,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:20,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:20,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:20,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:20,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:20,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:20,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:20,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:20,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:20,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:20,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:20,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:20,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:20,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:20,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:20,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:20,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:20,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:20,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:20,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:20,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:20,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:20,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:20,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:20,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:20,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:20,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:20,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:20,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:20,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:20,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:20,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:20,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:20,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:20,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:20,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:20,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:20,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:20,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:20,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:20,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-11-18 15:27:20,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,846 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 15:27:20,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:20,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,848 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:27:20,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:20,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:20,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:20,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:20,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:20,865 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-18 15:27:20,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,869 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 15:27:20,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:20,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:20,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:20,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:20,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:20,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:20,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:20,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:20,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:20,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:20,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:20,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:20,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:20,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:20,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:20,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:20,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:20,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:20,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:20,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:20,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:20,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:20,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:20,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:20,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:20,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:20,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:20,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:20,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:20,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:20,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:20,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:20,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:20,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:20,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:20,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:20,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:20,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:20,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:20,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:20,929 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:27:20,947 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 15:27:20,947 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 15:27:20,949 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:27:20,950 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:27:20,951 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:27:20,951 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_substring_~ps~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1) = -1*ULTIMATE.start_substring_~ps~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1 Supporting invariants [] [2018-11-18 15:27:20,992 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-18 15:27:20,997 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 15:27:21,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:21,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:27:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:21,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:27:21,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:27:21,075 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 15:27:21,076 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-18 15:27:21,137 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 23 states and 30 transitions. Complement of second has 6 states. [2018-11-18 15:27:21,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 15:27:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 15:27:21,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-18 15:27:21,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 5 letters. Loop has 9 letters. [2018-11-18 15:27:21,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:27:21,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 9 letters. [2018-11-18 15:27:21,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:27:21,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-18 15:27:21,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:27:21,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-11-18 15:27:21,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:27:21,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 21 states and 28 transitions. [2018-11-18 15:27:21,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 15:27:21,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 15:27:21,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2018-11-18 15:27:21,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:27:21,144 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-18 15:27:21,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2018-11-18 15:27:21,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-18 15:27:21,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 15:27:21,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-11-18 15:27:21,145 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-18 15:27:21,145 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-18 15:27:21,146 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 15:27:21,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2018-11-18 15:27:21,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:27:21,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:27:21,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:27:21,147 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:27:21,147 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:27:21,147 INFO L794 eck$LassoCheckResult]: Stem: 206#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 198#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 189#L558 assume !(main_~length1~0 < 1); 190#L558-2 assume !(main_~length2~0 < 1); 191#L561-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);assume { :begin_inline_substring } true;substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 209#L543-4 assume true; 199#L543-1 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 200#L543-2 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 203#L546-6 [2018-11-18 15:27:21,147 INFO L796 eck$LassoCheckResult]: Loop: 203#L546-6 assume true; 192#L546-1 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 193#L546-2 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 196#L546-4 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 203#L546-6 [2018-11-18 15:27:21,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:21,147 INFO L82 PathProgramCache]: Analyzing trace with hash 180428530, now seen corresponding path program 1 times [2018-11-18 15:27:21,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:27:21,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:27:21,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:21,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:27:21,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:21,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:21,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1849131, now seen corresponding path program 1 times [2018-11-18 15:27:21,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:27:21,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:27:21,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:21,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:27:21,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:21,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:21,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1986164124, now seen corresponding path program 1 times [2018-11-18 15:27:21,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:27:21,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:27:21,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:21,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:27:21,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:21,541 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 97 [2018-11-18 15:27:21,611 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:27:21,611 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:27:21,611 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:27:21,611 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:27:21,612 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:27:21,612 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:27:21,612 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:27:21,612 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:27:21,612 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-18 15:27:21,612 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:27:21,612 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:27:21,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:21,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:21,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:21,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:21,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:21,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:21,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:21,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:21,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:21,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:21,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:21,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:21,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:21,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:21,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:21,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:21,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:21,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:21,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:21,873 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2018-11-18 15:27:21,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:21,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:22,292 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:27:22,292 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:27:22,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:22,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:22,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:22,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:22,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:22,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:22,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:22,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:22,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:22,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:22,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:22,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:22,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:22,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:22,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:22,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:22,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:22,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:22,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:22,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:22,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:22,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:22,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:22,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:22,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:22,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:22,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:22,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:22,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:22,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:22,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:22,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:22,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:22,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:22,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:22,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:22,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:22,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:22,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:22,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:22,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:22,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:22,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:22,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:22,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:22,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:22,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:22,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:22,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:22,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:22,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:22,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:22,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:22,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:22,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:22,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:22,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:22,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:22,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:22,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:22,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:22,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:22,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:22,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:22,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:22,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:22,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:22,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:22,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,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-11-18 15:27:22,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:22,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:22,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:22,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,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-11-18 15:27:22,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:22,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:22,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:22,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:22,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:22,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:22,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:22,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:22,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:22,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,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-11-18 15:27:22,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:22,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:22,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:22,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:22,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,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-11-18 15:27:22,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:22,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:22,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:22,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:22,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,328 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 15:27:22,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,330 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:27:22,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:22,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:22,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:22,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:22,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:22,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:22,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:22,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:22,342 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:22,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,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-11-18 15:27:22,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,346 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 15:27:22,347 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:27:22,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,349 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-18 15:27:22,349 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 15:27:22,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:22,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:22,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:22,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:22,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:22,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,362 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 15:27:22,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,364 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:27:22,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:22,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:22,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:22,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:22,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:22,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:22,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:22,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:22,373 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:22,404 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:27:22,431 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 15:27:22,431 INFO L444 ModelExtractionUtils]: 48 out of 55 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 15:27:22,431 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:27:22,432 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:27:22,432 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:27:22,432 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2018-11-18 15:27:22,513 INFO L297 tatePredicateManager]: 20 out of 23 supporting invariants were superfluous and have been removed [2018-11-18 15:27:22,518 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 15:27:22,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:22,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:27:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:22,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:27:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:27:22,596 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 15:27:22,596 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-18 15:27:22,652 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 77 states and 93 transitions. Complement of second has 8 states. [2018-11-18 15:27:22,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 15:27:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 15:27:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-18 15:27:22,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-18 15:27:22,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:27:22,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 12 letters. Loop has 4 letters. [2018-11-18 15:27:22,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:27:22,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 8 letters. [2018-11-18 15:27:22,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:27:22,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 93 transitions. [2018-11-18 15:27:22,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-18 15:27:22,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 62 states and 78 transitions. [2018-11-18 15:27:22,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-18 15:27:22,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-18 15:27:22,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 78 transitions. [2018-11-18 15:27:22,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:27:22,662 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 78 transitions. [2018-11-18 15:27:22,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 78 transitions. [2018-11-18 15:27:22,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2018-11-18 15:27:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 15:27:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2018-11-18 15:27:22,666 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2018-11-18 15:27:22,666 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2018-11-18 15:27:22,666 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 15:27:22,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 61 transitions. [2018-11-18 15:27:22,667 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-18 15:27:22,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:27:22,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:27:22,667 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:27:22,668 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:27:22,668 INFO L794 eck$LassoCheckResult]: Stem: 466#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 458#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 447#L558 assume !(main_~length1~0 < 1); 448#L558-2 assume !(main_~length2~0 < 1); 449#L561-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);assume { :begin_inline_substring } true;substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 475#L543-4 assume true; 476#L543-1 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 467#L543-2 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 468#L546-6 assume true; 479#L546-1 [2018-11-18 15:27:22,668 INFO L796 eck$LassoCheckResult]: Loop: 479#L546-1 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 454#L546-2 assume !substring_#t~short6; 455#L546-4 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 459#L546-6 assume true; 479#L546-1 [2018-11-18 15:27:22,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:22,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1298317164, now seen corresponding path program 1 times [2018-11-18 15:27:22,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:27:22,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:27:22,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:22,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:27:22,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:22,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:22,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1913753, now seen corresponding path program 1 times [2018-11-18 15:27:22,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:27:22,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:27:22,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:22,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:27:22,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:22,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:27:22,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:27:22,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:27:22,707 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:27:22,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:27:22,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:27:22,708 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. cyclomatic complexity: 20 Second operand 3 states. [2018-11-18 15:27:22,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:27:22,732 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2018-11-18 15:27:22,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:27:22,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2018-11-18 15:27:22,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:27:22,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 32 states and 39 transitions. [2018-11-18 15:27:22,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 15:27:22,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 15:27:22,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2018-11-18 15:27:22,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:27:22,736 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-18 15:27:22,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2018-11-18 15:27:22,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-18 15:27:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 15:27:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-18 15:27:22,738 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-18 15:27:22,738 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-18 15:27:22,738 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 15:27:22,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2018-11-18 15:27:22,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:27:22,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:27:22,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:27:22,742 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:27:22,742 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:27:22,742 INFO L794 eck$LassoCheckResult]: Stem: 562#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 554#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 545#L558 assume !(main_~length1~0 < 1); 546#L558-2 assume !(main_~length2~0 < 1); 547#L561-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);assume { :begin_inline_substring } true;substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 568#L543-4 assume true; 569#L543-1 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 574#L543-2 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 557#L546-6 assume true; 550#L546-1 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 551#L546-2 assume !substring_#t~short6; 553#L546-4 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6; 567#L546-7 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 565#L550 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 566#L543-4 assume true; 558#L543-1 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 559#L543-2 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 555#L546-6 [2018-11-18 15:27:22,742 INFO L796 eck$LassoCheckResult]: Loop: 555#L546-6 assume true; 548#L546-1 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 549#L546-2 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 552#L546-4 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 555#L546-6 [2018-11-18 15:27:22,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:22,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1361293083, now seen corresponding path program 1 times [2018-11-18 15:27:22,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:27:22,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:27:22,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:22,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:27:22,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:22,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:27:22,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:27:22,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:27:22,785 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:27:22,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:22,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1849131, now seen corresponding path program 2 times [2018-11-18 15:27:22,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:27:22,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:27:22,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:22,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:27:22,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:22,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:27:22,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:27:22,887 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-18 15:27:22,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:27:22,911 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-18 15:27:22,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:27:22,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2018-11-18 15:27:22,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:27:22,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 30 states and 35 transitions. [2018-11-18 15:27:22,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 15:27:22,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 15:27:22,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 35 transitions. [2018-11-18 15:27:22,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:27:22,913 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-18 15:27:22,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 35 transitions. [2018-11-18 15:27:22,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-18 15:27:22,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 15:27:22,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-18 15:27:22,915 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-18 15:27:22,916 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-18 15:27:22,916 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 15:27:22,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2018-11-18 15:27:22,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:27:22,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:27:22,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:27:22,917 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:27:22,917 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:27:22,917 INFO L794 eck$LassoCheckResult]: Stem: 635#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 627#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 618#L558 assume !(main_~length1~0 < 1); 619#L558-2 assume !(main_~length2~0 < 1); 620#L561-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);assume { :begin_inline_substring } true;substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 640#L543-4 assume true; 641#L543-1 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 645#L543-2 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 634#L546-6 assume true; 623#L546-1 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 624#L546-2 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 626#L546-4 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6; 642#L546-7 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 638#L550 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 639#L543-4 assume true; 628#L543-1 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 629#L543-2 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 632#L546-6 [2018-11-18 15:27:22,917 INFO L796 eck$LassoCheckResult]: Loop: 632#L546-6 assume true; 621#L546-1 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 622#L546-2 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 625#L546-4 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 632#L546-6 [2018-11-18 15:27:22,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:22,917 INFO L82 PathProgramCache]: Analyzing trace with hash -413714279, now seen corresponding path program 2 times [2018-11-18 15:27:22,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:27:22,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:27:22,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:22,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:27:22,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:22,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:22,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1849131, now seen corresponding path program 3 times [2018-11-18 15:27:22,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:27:22,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:27:22,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:22,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:27:22,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:22,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:22,946 INFO L82 PathProgramCache]: Analyzing trace with hash -2123013181, now seen corresponding path program 1 times [2018-11-18 15:27:22,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:27:22,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:27:22,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:22,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:27:22,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:27:23,400 WARN L180 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 138 [2018-11-18 15:27:23,490 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:27:23,490 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:27:23,490 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:27:23,491 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:27:23,491 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:27:23,491 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:27:23,491 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:27:23,491 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:27:23,491 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-18 15:27:23,491 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:27:23,491 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:27:23,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:23,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:23,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:23,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:23,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:23,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:23,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:23,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:23,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:23,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:23,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:23,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:23,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:23,849 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 96 [2018-11-18 15:27:23,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:23,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:23,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:23,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:23,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:23,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:23,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:23,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:23,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:27:24,424 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-11-18 15:27:24,548 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:27:24,548 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:27:24,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-11-18 15:27:24,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:24,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:24,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:24,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:24,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:24,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:24,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:24,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:24,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:24,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:24,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:24,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:24,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:24,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:24,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:24,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:24,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-11-18 15:27:24,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:24,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:24,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:24,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:24,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:24,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:24,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:24,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:24,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-11-18 15:27:24,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:24,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:24,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:24,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:24,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:24,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:24,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:24,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:24,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:24,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:24,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:24,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:24,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:24,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:24,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:24,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:24,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:24,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:24,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:24,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:24,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:24,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:24,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:24,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:24,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:24,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:24,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-11-18 15:27:24,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:24,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:24,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:24,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:24,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:24,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:24,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:24,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:24,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:24,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:24,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:24,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:24,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:24,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:24,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:24,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:24,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:24,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:24,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:24,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:24,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:24,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:24,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:24,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:24,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:24,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-11-18 15:27:24,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:24,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:24,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:24,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:24,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:24,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:24,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:24,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-11-18 15:27:24,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:24,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:24,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:24,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:24,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:24,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:24,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:24,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:24,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:24,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:24,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:27:24,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:24,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:24,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:24,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:27:24,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:27:24,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:24,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:24,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:24,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:24,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:24,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:24,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:24,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:24,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:24,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:24,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:24,584 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 15:27:24,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:24,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:24,585 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:27:24,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:24,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:24,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:24,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:24,592 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-11-18 15:27:24,592 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:27:24,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:24,600 INFO L402 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2018-11-18 15:27:24,600 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 15:27:24,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:24,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:24,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:24,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:24,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:24,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:24,625 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:24,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:24,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:24,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:24,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:24,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:24,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:24,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:24,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:24,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:24,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:24,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:24,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:24,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:24,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:24,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:24,635 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:24,635 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:24,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:24,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:24,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:24,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:24,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:24,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:24,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:24,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:24,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:27:24,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:27:24,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:27:24,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:27:24,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:27:24,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:27:24,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:27:24,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:27:24,657 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:27:24,674 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 15:27:24,674 INFO L444 ModelExtractionUtils]: 52 out of 58 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 15:27:24,675 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:27:24,675 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:27:24,676 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:27:24,676 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_2, ULTIMATE.start_substring_~ps2~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_2 - 1*ULTIMATE.start_substring_~ps2~0.offset Supporting invariants [] [2018-11-18 15:27:24,795 INFO L297 tatePredicateManager]: 43 out of 45 supporting invariants were superfluous and have been removed [2018-11-18 15:27:24,798 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 15:27:24,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:24,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:27:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:24,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:27:24,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:27:24,860 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 15:27:24,860 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 35 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-18 15:27:24,908 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 35 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 50 states and 56 transitions. Complement of second has 8 states. [2018-11-18 15:27:24,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 15:27:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 15:27:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-18 15:27:24,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 17 letters. Loop has 4 letters. [2018-11-18 15:27:24,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:27:24,910 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 15:27:24,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:24,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:27:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:24,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:27:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:27:24,968 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 15:27:24,968 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 35 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-18 15:27:24,996 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 35 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 50 states and 56 transitions. Complement of second has 8 states. [2018-11-18 15:27:24,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 15:27:24,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 15:27:24,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-18 15:27:24,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 17 letters. Loop has 4 letters. [2018-11-18 15:27:24,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:27:24,997 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 15:27:25,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:25,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:27:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:25,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:27:25,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:27:25,062 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 15:27:25,062 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 35 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-18 15:27:25,089 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 35 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 50 states and 57 transitions. Complement of second has 7 states. [2018-11-18 15:27:25,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 15:27:25,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 15:27:25,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-18 15:27:25,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 17 letters. Loop has 4 letters. [2018-11-18 15:27:25,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:27:25,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 21 letters. Loop has 4 letters. [2018-11-18 15:27:25,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:27:25,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 17 letters. Loop has 8 letters. [2018-11-18 15:27:25,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:27:25,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 57 transitions. [2018-11-18 15:27:25,092 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:27:25,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 0 states and 0 transitions. [2018-11-18 15:27:25,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 15:27:25,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 15:27:25,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 15:27:25,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:27:25,093 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:27:25,093 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:27:25,093 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:27:25,093 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 15:27:25,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 15:27:25,093 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:27:25,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 15:27:25,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 03:27:25 BoogieIcfgContainer [2018-11-18 15:27:25,098 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 15:27:25,098 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:27:25,098 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:27:25,098 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:27:25,099 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:27:19" (3/4) ... [2018-11-18 15:27:25,101 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 15:27:25,101 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:27:25,102 INFO L168 Benchmark]: Toolchain (without parser) took 6344.67 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 238.0 MB). Free memory was 955.5 MB in the beginning and 1.2 GB in the end (delta: -257.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:27:25,103 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:27:25,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -170.7 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-18 15:27:25,104 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:27:25,104 INFO L168 Benchmark]: Boogie Preprocessor took 15.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:27:25,104 INFO L168 Benchmark]: RCFGBuilder took 182.76 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:27:25,105 INFO L168 Benchmark]: BuchiAutomizer took 5775.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 100.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -109.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:27:25,105 INFO L168 Benchmark]: Witness Printer took 3.40 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:27:25,108 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 334.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -170.7 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 182.76 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5775.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 100.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -109.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.40 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * ps + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[nondetString1] + -1 * pt and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[nondetString1] + -1 * ps2 and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 4.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 17 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 47 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 124 SDtfs, 92 SDslu, 80 SDs, 0 SdLazy, 106 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital249 mio100 ax100 hnf99 lsp96 ukn85 mio100 lsp40 div100 bol100 ite100 ukn100 eq189 hnf88 smp95 dnf189 smp75 tf100 neg91 sie118 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 12 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 60 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...