./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d9368954-50bc-43dc-8070-df7451315045/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d9368954-50bc-43dc-8070-df7451315045/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d9368954-50bc-43dc-8070-df7451315045/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d9368954-50bc-43dc-8070-df7451315045/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_d9368954-50bc-43dc-8070-df7451315045/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d9368954-50bc-43dc-8070-df7451315045/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-635dfa2 [2018-12-08 20:19:13,713 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 20:19:13,714 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 20:19:13,722 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 20:19:13,722 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 20:19:13,722 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 20:19:13,723 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 20:19:13,724 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 20:19:13,725 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 20:19:13,725 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 20:19:13,726 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 20:19:13,726 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 20:19:13,727 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 20:19:13,727 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 20:19:13,728 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 20:19:13,729 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 20:19:13,729 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 20:19:13,730 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 20:19:13,732 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 20:19:13,733 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 20:19:13,733 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 20:19:13,734 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 20:19:13,736 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 20:19:13,736 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 20:19:13,736 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 20:19:13,737 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 20:19:13,737 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 20:19:13,738 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 20:19:13,738 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 20:19:13,739 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 20:19:13,739 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 20:19:13,740 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 20:19:13,740 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 20:19:13,740 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 20:19:13,740 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 20:19:13,741 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 20:19:13,741 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d9368954-50bc-43dc-8070-df7451315045/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 20:19:13,752 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 20:19:13,752 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 20:19:13,753 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 20:19:13,753 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 20:19:13,753 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 20:19:13,753 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 20:19:13,754 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 20:19:13,754 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 20:19:13,754 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 20:19:13,754 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 20:19:13,754 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 20:19:13,754 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 20:19:13,754 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 20:19:13,754 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 20:19:13,754 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 20:19:13,755 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 20:19:13,755 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 20:19:13,755 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 20:19:13,755 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 20:19:13,755 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 20:19:13,755 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 20:19:13,755 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 20:19:13,755 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 20:19:13,756 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 20:19:13,756 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 20:19:13,756 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 20:19:13,756 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 20:19:13,756 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 20:19:13,756 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 20:19:13,756 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 20:19:13,756 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 20:19:13,757 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 20:19:13,757 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_d9368954-50bc-43dc-8070-df7451315045/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-12-08 20:19:13,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 20:19:13,784 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 20:19:13,786 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 20:19:13,787 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 20:19:13,787 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 20:19:13,788 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d9368954-50bc-43dc-8070-df7451315045/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-12-08 20:19:13,823 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d9368954-50bc-43dc-8070-df7451315045/bin-2019/uautomizer/data/f22eec04a/b3948df04c3f4ec8890430e3f52a03fc/FLAG8f90e662f [2018-12-08 20:19:14,234 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 20:19:14,235 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d9368954-50bc-43dc-8070-df7451315045/sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-12-08 20:19:14,243 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d9368954-50bc-43dc-8070-df7451315045/bin-2019/uautomizer/data/f22eec04a/b3948df04c3f4ec8890430e3f52a03fc/FLAG8f90e662f [2018-12-08 20:19:14,254 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d9368954-50bc-43dc-8070-df7451315045/bin-2019/uautomizer/data/f22eec04a/b3948df04c3f4ec8890430e3f52a03fc [2018-12-08 20:19:14,256 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 20:19:14,257 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 20:19:14,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 20:19:14,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 20:19:14,259 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 20:19:14,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:19:14" (1/1) ... [2018-12-08 20:19:14,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@89db293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:14, skipping insertion in model container [2018-12-08 20:19:14,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:19:14" (1/1) ... [2018-12-08 20:19:14,266 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 20:19:14,283 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 20:19:14,426 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:19:14,433 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 20:19:14,508 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:19:14,529 INFO L195 MainTranslator]: Completed translation [2018-12-08 20:19:14,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:14 WrapperNode [2018-12-08 20:19:14,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 20:19:14,530 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 20:19:14,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 20:19:14,530 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 20:19:14,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:14" (1/1) ... [2018-12-08 20:19:14,543 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:14" (1/1) ... [2018-12-08 20:19:14,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 20:19:14,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 20:19:14,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 20:19:14,555 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 20:19:14,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:14" (1/1) ... [2018-12-08 20:19:14,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:14" (1/1) ... [2018-12-08 20:19:14,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:14" (1/1) ... [2018-12-08 20:19:14,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:14" (1/1) ... [2018-12-08 20:19:14,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:14" (1/1) ... [2018-12-08 20:19:14,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:14" (1/1) ... [2018-12-08 20:19:14,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:14" (1/1) ... [2018-12-08 20:19:14,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 20:19:14,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 20:19:14,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 20:19:14,569 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 20:19:14,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9368954-50bc-43dc-8070-df7451315045/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:19:14,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 20:19:14,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 20:19:14,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 20:19:14,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 20:19:14,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 20:19:14,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 20:19:14,728 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 20:19:14,728 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 20:19:14,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:19:14 BoogieIcfgContainer [2018-12-08 20:19:14,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 20:19:14,729 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 20:19:14,729 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 20:19:14,731 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 20:19:14,732 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 20:19:14,732 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 08:19:14" (1/3) ... [2018-12-08 20:19:14,733 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33f99610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 08:19:14, skipping insertion in model container [2018-12-08 20:19:14,733 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 20:19:14,733 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:14" (2/3) ... [2018-12-08 20:19:14,733 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33f99610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 08:19:14, skipping insertion in model container [2018-12-08 20:19:14,733 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 20:19:14,733 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:19:14" (3/3) ... [2018-12-08 20:19:14,734 INFO L375 chiAutomizerObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-12-08 20:19:14,765 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 20:19:14,766 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 20:19:14,766 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 20:19:14,766 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 20:19:14,766 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 20:19:14,766 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 20:19:14,766 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 20:19:14,766 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 20:19:14,766 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 20:19:14,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-08 20:19:14,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-08 20:19:14,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:19:14,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:19:14,790 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 20:19:14,791 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 20:19:14,791 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 20:19:14,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-08 20:19:14,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-08 20:19:14,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:19:14,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:19:14,792 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 20:19:14,792 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 20:19:14,797 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true 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); 18#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);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; 13#L543-3true [2018-12-08 20:19:14,797 INFO L796 eck$LassoCheckResult]: Loop: 13#L543-3true call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 10#L543-1true 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; 12#L546-5true assume !true; 14#L546-6true 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; 13#L543-3true [2018-12-08 20:19:14,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:19:14,801 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-08 20:19:14,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:19:14,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:19:14,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:14,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:19:14,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:14,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:19:14,886 INFO L82 PathProgramCache]: Analyzing trace with hash 47887114, now seen corresponding path program 1 times [2018-12-08 20:19:14,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:19:14,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:19:14,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:14,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:19:14,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:19:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:19:14,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:19:14,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 20:19:14,909 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 20:19:14,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 20:19:14,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 20:19:14,919 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2018-12-08 20:19:14,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:19:14,923 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-12-08 20:19:14,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 20:19:14,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-12-08 20:19:14,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-08 20:19:14,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 16 transitions. [2018-12-08 20:19:14,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-08 20:19:14,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-08 20:19:14,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-12-08 20:19:14,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 20:19:14,928 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-12-08 20:19:14,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-12-08 20:19:14,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-08 20:19:14,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-08 20:19:14,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-12-08 20:19:14,945 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-12-08 20:19:14,945 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-12-08 20:19:14,945 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 20:19:14,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2018-12-08 20:19:14,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-08 20:19:14,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:19:14,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:19:14,946 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 20:19:14,946 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:19:14,946 INFO L794 eck$LassoCheckResult]: Stem: 47#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 42#L-1 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; 43#L558 assume !(main_~length1~0 < 1); 44#L558-2 assume !(main_~length2~0 < 1); 51#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);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; 52#L543-3 [2018-12-08 20:19:14,947 INFO L796 eck$LassoCheckResult]: Loop: 52#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 45#L543-1 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; 46#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 48#L546-1 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; 53#L546-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; 49#L546-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 50#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; 52#L543-3 [2018-12-08 20:19:14,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:19:14,947 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-12-08 20:19:14,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:19:14,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:19:14,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:14,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:19:14,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:14,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:19:14,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1237496093, now seen corresponding path program 1 times [2018-12-08 20:19:14,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:19:14,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:19:14,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:14,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:19:14,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:14,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:19:14,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1302992386, now seen corresponding path program 1 times [2018-12-08 20:19:14,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:19:14,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:19:14,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:14,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:19:14,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:15,129 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2018-12-08 20:19:15,324 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-12-08 20:19:15,388 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:19:15,389 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:19:15,389 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:19:15,389 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:19:15,389 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 20:19:15,389 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:19:15,389 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:19:15,389 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:19:15,390 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-12-08 20:19:15,390 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:19:15,390 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:19:15,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:15,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:15,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:15,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:15,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:15,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:15,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:15,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:15,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:15,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:15,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:15,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:15,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:15,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:15,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:15,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:15,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:15,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:15,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:15,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:15,998 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:19:16,001 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 20:19:16,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:16,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:16,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:19:16,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:16,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:16,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:16,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:19:16,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:19:16,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:16,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:16,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:16,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:19:16,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:16,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:16,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:16,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:19:16,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:19:16,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:16,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:16,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:16,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:16,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:16,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:16,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:19:16,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:19:16,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:16,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:16,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:16,012 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 20:19:16,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:16,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:16,014 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 20:19:16,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:19:16,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:16,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:16,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:16,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:19:16,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:16,027 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-12-08 20:19:16,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:16,028 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 20:19:16,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:19:16,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:16,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:16,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:16,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:16,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:16,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:16,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:19:16,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:19:16,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:16,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:16,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:16,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:16,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:16,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:16,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:19:16,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:19:16,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:16,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:16,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:16,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:19:16,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:16,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:16,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:16,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:19:16,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:19:16,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:16,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:16,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:16,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:16,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:16,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:16,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:19:16,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:19:16,061 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 20:19:16,069 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 20:19:16,069 INFO L444 ModelExtractionUtils]: 27 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 20:19:16,071 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 20:19:16,071 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 20:19:16,072 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 20:19:16,072 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1, ULTIMATE.start_substring_~ps~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1 - 1*ULTIMATE.start_substring_~ps~0.offset Supporting invariants [] [2018-12-08 20:19:16,100 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-08 20:19:16,105 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 20:19:16,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:19:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:19:16,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:19:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:19:16,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:19:16,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:19:16,165 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-12-08 20:19:16,165 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-08 20:19:16,218 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 19 states and 26 transitions. Complement of second has 4 states. [2018-12-08 20:19:16,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 20:19:16,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 20:19:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-12-08 20:19:16,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 7 letters. [2018-12-08 20:19:16,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:19:16,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 12 letters. Loop has 7 letters. [2018-12-08 20:19:16,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:19:16,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 14 letters. [2018-12-08 20:19:16,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:19:16,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2018-12-08 20:19:16,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 20:19:16,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 24 transitions. [2018-12-08 20:19:16,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 20:19:16,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-08 20:19:16,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2018-12-08 20:19:16,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:19:16,223 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-12-08 20:19:16,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2018-12-08 20:19:16,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-08 20:19:16,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-08 20:19:16,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-12-08 20:19:16,224 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-12-08 20:19:16,224 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-12-08 20:19:16,224 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 20:19:16,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2018-12-08 20:19:16,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 20:19:16,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:19:16,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:19:16,225 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:19:16,225 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 20:19:16,225 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 170#L-1 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; 171#L558 assume !(main_~length1~0 < 1); 172#L558-2 assume !(main_~length2~0 < 1); 184#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);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; 182#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 173#L543-1 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; 174#L546-5 [2018-12-08 20:19:16,225 INFO L796 eck$LassoCheckResult]: Loop: 174#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 178#L546-1 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; 185#L546-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;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; 174#L546-5 [2018-12-08 20:19:16,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:19:16,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2018-12-08 20:19:16,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:19:16,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:19:16,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:16,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:19:16,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:16,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:19:16,246 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 1 times [2018-12-08 20:19:16,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:19:16,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:19:16,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:16,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:19:16,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:16,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:19:16,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1594173083, now seen corresponding path program 1 times [2018-12-08 20:19:16,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:19:16,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:19:16,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:16,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:19:16,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:16,520 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 100 [2018-12-08 20:19:16,588 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:19:16,589 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:19:16,589 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:19:16,589 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:19:16,589 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 20:19:16,589 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:19:16,589 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:19:16,589 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:19:16,589 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-12-08 20:19:16,589 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:19:16,589 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:19:16,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:16,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:16,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:16,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:16,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:16,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:16,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:16,815 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2018-12-08 20:19:16,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:16,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:16,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:16,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:16,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:16,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:16,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:16,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:16,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:16,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:16,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:16,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:16,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:16,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:17,211 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:19:17,211 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 20:19:17,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:17,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:17,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:19:17,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:17,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:17,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:17,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:19:17,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:19:17,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:17,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:17,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:17,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:19:17,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:17,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:17,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:17,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:19:17,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:19:17,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:17,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:17,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:17,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:17,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:17,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:17,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:19:17,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:19:17,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:17,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:17,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:17,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:19:17,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:17,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:17,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:17,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:19:17,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:19:17,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:17,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:17,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:17,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:19:17,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:17,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:17,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:17,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:19:17,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:19:17,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:17,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:17,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:17,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:19:17,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:17,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:17,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:17,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:19:17,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:19:17,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:17,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:17,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:17,224 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 20:19:17,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:17,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:17,226 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 20:19:17,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:19:17,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:17,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:17,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:17,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:17,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:17,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:17,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:19:17,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:19:17,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:17,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:17,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:17,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:17,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:17,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:17,241 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:19:17,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:19:17,274 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 20:19:17,298 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 20:19:17,299 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-08 20:19:17,299 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 20:19:17,299 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 20:19:17,299 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 20:19:17,300 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-12-08 20:19:17,355 INFO L297 tatePredicateManager]: 20 out of 23 supporting invariants were superfluous and have been removed [2018-12-08 20:19:17,359 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 20:19:17,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:19:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:19:17,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:19:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:19:17,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:19:17,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:19:17,414 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-08 20:19:17,414 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-12-08 20:19:17,465 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 59 states and 76 transitions. Complement of second has 8 states. [2018-12-08 20:19:17,465 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-12-08 20:19:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 20:19:17,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-12-08 20:19:17,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-08 20:19:17,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:19:17,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-08 20:19:17,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:19:17,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-08 20:19:17,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:19:17,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2018-12-08 20:19:17,468 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-08 20:19:17,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 48 states and 64 transitions. [2018-12-08 20:19:17,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-08 20:19:17,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-12-08 20:19:17,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2018-12-08 20:19:17,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:19:17,470 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2018-12-08 20:19:17,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2018-12-08 20:19:17,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2018-12-08 20:19:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-08 20:19:17,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2018-12-08 20:19:17,472 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2018-12-08 20:19:17,472 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2018-12-08 20:19:17,472 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 20:19:17,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2018-12-08 20:19:17,473 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-08 20:19:17,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:19:17,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:19:17,473 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:19:17,473 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 20:19:17,473 INFO L794 eck$LassoCheckResult]: Stem: 407#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 400#L-1 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; 401#L558 assume !(main_~length1~0 < 1); 406#L558-2 assume !(main_~length2~0 < 1); 412#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);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; 415#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 402#L543-1 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; 403#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 409#L546-1 [2018-12-08 20:19:17,473 INFO L796 eck$LassoCheckResult]: Loop: 409#L546-1 assume !substring_#t~short6; 419#L546-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;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; 408#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 409#L546-1 [2018-12-08 20:19:17,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:19:17,473 INFO L82 PathProgramCache]: Analyzing trace with hash 180429619, now seen corresponding path program 1 times [2018-12-08 20:19:17,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:19:17,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:19:17,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:17,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:19:17,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:17,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:19:17,485 INFO L82 PathProgramCache]: Analyzing trace with hash 64727, now seen corresponding path program 1 times [2018-12-08 20:19:17,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:19:17,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:19:17,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:17,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:19:17,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:19:17,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:19:17,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:19:17,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 20:19:17,497 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 20:19:17,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:19:17,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:19:17,497 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. cyclomatic complexity: 20 Second operand 3 states. [2018-12-08 20:19:17,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:19:17,505 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2018-12-08 20:19:17,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:19:17,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2018-12-08 20:19:17,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 20:19:17,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 25 states and 32 transitions. [2018-12-08 20:19:17,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-08 20:19:17,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-08 20:19:17,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2018-12-08 20:19:17,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:19:17,507 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-12-08 20:19:17,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2018-12-08 20:19:17,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-12-08 20:19:17,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-08 20:19:17,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-12-08 20:19:17,508 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-08 20:19:17,508 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-08 20:19:17,508 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 20:19:17,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-12-08 20:19:17,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 20:19:17,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:19:17,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:19:17,508 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:19:17,508 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 20:19:17,509 INFO L794 eck$LassoCheckResult]: Stem: 485#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 478#L-1 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; 479#L558 assume !(main_~length1~0 < 1); 484#L558-2 assume !(main_~length2~0 < 1); 494#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);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; 489#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 482#L543-1 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; 483#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 496#L546-1 assume !substring_#t~short6; 497#L546-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; 492#L546-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 493#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; 490#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 480#L543-1 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; 481#L546-5 [2018-12-08 20:19:17,509 INFO L796 eck$LassoCheckResult]: Loop: 481#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 486#L546-1 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; 495#L546-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;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; 481#L546-5 [2018-12-08 20:19:17,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:19:17,509 INFO L82 PathProgramCache]: Analyzing trace with hash 2012026433, now seen corresponding path program 1 times [2018-12-08 20:19:17,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:19:17,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:19:17,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:17,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:19:17,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:19:17,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:19:17,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:19:17,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:19:17,531 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 20:19:17,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:19:17,532 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 2 times [2018-12-08 20:19:17,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:19:17,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:19:17,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:17,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:19:17,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:17,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:19:17,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:19:17,607 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-12-08 20:19:17,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:19:17,626 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-12-08 20:19:17,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:19:17,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2018-12-08 20:19:17,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 20:19:17,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 28 transitions. [2018-12-08 20:19:17,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-08 20:19:17,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-08 20:19:17,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2018-12-08 20:19:17,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:19:17,627 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-12-08 20:19:17,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2018-12-08 20:19:17,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-08 20:19:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-08 20:19:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-12-08 20:19:17,628 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-12-08 20:19:17,628 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-12-08 20:19:17,628 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 20:19:17,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2018-12-08 20:19:17,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 20:19:17,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:19:17,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:19:17,629 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:19:17,629 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 20:19:17,629 INFO L794 eck$LassoCheckResult]: Stem: 544#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 537#L-1 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; 538#L558 assume !(main_~length1~0 < 1); 543#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);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; 548#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 549#L543-1 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-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 554#L546-1 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; 555#L546-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; 551#L546-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 552#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; 550#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 539#L543-1 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; 540#L546-5 [2018-12-08 20:19:17,629 INFO L796 eck$LassoCheckResult]: Loop: 540#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 545#L546-1 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; 553#L546-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;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; 540#L546-5 [2018-12-08 20:19:17,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:19:17,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1954768131, now seen corresponding path program 2 times [2018-12-08 20:19:17,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:19:17,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:19:17,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:17,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:19:17,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:17,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:19:17,643 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 3 times [2018-12-08 20:19:17,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:19:17,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:19:17,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:17,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:19:17,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:17,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:19:17,647 INFO L82 PathProgramCache]: Analyzing trace with hash -964145949, now seen corresponding path program 1 times [2018-12-08 20:19:17,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:19:17,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:19:17,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:17,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:19:17,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:19:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:19:18,118 WARN L180 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 143 [2018-12-08 20:19:18,212 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:19:18,212 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:19:18,212 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:19:18,212 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:19:18,212 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 20:19:18,212 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:19:18,212 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:19:18,212 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:19:18,212 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-12-08 20:19:18,212 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:19:18,212 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:19:18,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:18,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:18,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:18,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:18,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:18,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:18,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:18,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:18,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:18,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:18,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:18,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:18,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:18,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:18,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:18,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:18,550 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 96 [2018-12-08 20:19:18,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:18,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:18,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:18,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:18,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:18,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:19:19,092 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-12-08 20:19:19,215 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:19:19,215 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 20:19:19,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:19,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:19,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:19:19,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:19:19,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:19,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:19:19,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:19,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:19,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:19:19,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:19:19,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:19,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:19:19,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:19,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:19,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:19:19,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:19:19,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:19,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:19:19,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:19,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:19,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:19:19,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:19:19,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:19,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:19:19,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:19,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:19,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:19:19,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:19:19,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:19,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:19:19,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:19,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:19,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:19:19,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:19:19,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:19,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:19,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:19,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:19:19,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:19:19,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:19,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:19:19,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:19,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:19,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:19:19,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:19:19,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:19,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:19:19,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:19,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:19,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:19:19,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:19:19,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:19,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:19,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:19,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:19:19,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:19:19,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:19,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:19:19,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:19,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:19,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:19:19,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:19:19,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:19,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:19:19,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:19,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:19,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:19:19,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:19:19,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:19,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:19:19,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:19,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:19,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:19:19,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:19:19,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:19,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:19:19,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:19,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:19,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:19:19,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:19:19,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:19,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:19:19,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:19,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:19,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:19:19,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:19:19,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:19,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:19,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:19,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,233 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:19:19,233 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:19:19,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:19,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,235 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 20:19:19,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:19,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,236 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 20:19:19,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:19:19,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:19,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,240 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-12-08 20:19:19,240 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 20:19:19,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,243 INFO L402 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2018-12-08 20:19:19,243 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 20:19:19,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:19,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:19,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:19,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:19:19,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:19:19,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:19,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:19,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:19,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:19:19,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:19:19,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:19,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:19,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:19,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:19:19,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:19:19,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:19,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:19,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:19,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:19:19,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:19:19,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:19,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,269 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 20:19:19,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:19,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,270 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 20:19:19,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:19:19,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:19:19,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:19:19,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:19:19,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:19:19,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:19:19,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:19:19,276 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:19:19,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:19:19,293 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 20:19:19,315 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-08 20:19:19,315 INFO L444 ModelExtractionUtils]: 49 out of 58 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-08 20:19:19,315 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 20:19:19,316 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 20:19:19,316 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 20:19:19,316 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_substring_~pt~0.base)_3, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_substring_~pt~0.base)_3 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2018-12-08 20:19:19,432 INFO L297 tatePredicateManager]: 45 out of 45 supporting invariants were superfluous and have been removed [2018-12-08 20:19:19,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 20:19:19,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:19:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:19:19,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:19:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:19:19,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:19:19,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:19:19,463 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-12-08 20:19:19,463 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-08 20:19:19,474 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 37 states and 43 transitions. Complement of second has 5 states. [2018-12-08 20:19:19,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 20:19:19,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 20:19:19,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-12-08 20:19:19,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-08 20:19:19,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:19:19,475 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 20:19:19,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:19:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:19:19,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:19:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:19:19,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:19:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:19:19,511 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 20:19:19,511 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-08 20:19:19,519 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 37 states and 43 transitions. Complement of second has 5 states. [2018-12-08 20:19:19,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 20:19:19,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 20:19:19,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-12-08 20:19:19,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-08 20:19:19,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:19:19,520 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 20:19:19,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:19:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:19:19,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:19:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:19:19,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:19:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:19:19,553 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 20:19:19,553 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-08 20:19:19,565 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 37 states and 44 transitions. Complement of second has 4 states. [2018-12-08 20:19:19,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 20:19:19,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 20:19:19,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-12-08 20:19:19,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-08 20:19:19,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:19:19,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 17 letters. Loop has 3 letters. [2018-12-08 20:19:19,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:19:19,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-08 20:19:19,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:19:19,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2018-12-08 20:19:19,568 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 20:19:19,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2018-12-08 20:19:19,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 20:19:19,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 20:19:19,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 20:19:19,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 20:19:19,568 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 20:19:19,568 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 20:19:19,568 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 20:19:19,568 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 20:19:19,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 20:19:19,569 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 20:19:19,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 20:19:19,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 08:19:19 BoogieIcfgContainer [2018-12-08 20:19:19,573 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 20:19:19,573 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 20:19:19,573 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 20:19:19,573 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 20:19:19,573 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:19:14" (3/4) ... [2018-12-08 20:19:19,575 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 20:19:19,575 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 20:19:19,576 INFO L168 Benchmark]: Toolchain (without parser) took 5319.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.4 MB). Free memory was 949.5 MB in the beginning and 854.0 MB in the end (delta: 95.6 MB). Peak memory consumption was 299.0 MB. Max. memory is 11.5 GB. [2018-12-08 20:19:19,576 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:19:19,577 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -145.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-08 20:19:19,577 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 20:19:19,577 INFO L168 Benchmark]: Boogie Preprocessor took 14.63 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:19:19,578 INFO L168 Benchmark]: RCFGBuilder took 159.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-08 20:19:19,578 INFO L168 Benchmark]: BuchiAutomizer took 4843.50 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 98.0 MB). Free memory was 1.1 GB in the beginning and 854.0 MB in the end (delta: 215.8 MB). Peak memory consumption was 313.8 MB. Max. memory is 11.5 GB. [2018-12-08 20:19:19,578 INFO L168 Benchmark]: Witness Printer took 2.63 ms. Allocated memory is still 1.2 GB. Free memory is still 854.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:19:19,580 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 272.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -145.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.63 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 159.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4843.50 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 98.0 MB). Free memory was 1.1 GB in the beginning and 854.0 MB in the end (delta: 215.8 MB). Peak memory consumption was 313.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.63 ms. Allocated memory is still 1.2 GB. Free memory is still 854.0 MB. 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 unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * ps and consists of 3 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[pt] + -1 * pt and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 4.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 37 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 116 SDtfs, 102 SDslu, 47 SDs, 0 SdLazy, 83 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital249 mio100 ax100 hnf99 lsp96 ukn85 mio100 lsp38 div100 bol100 ite100 ukn100 eq189 hnf88 smp95 dnf192 smp75 tf100 neg91 sie118 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms 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...