./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4c303625-5059-410f-b80b-9deeb3f93048/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4c303625-5059-410f-b80b-9deeb3f93048/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4c303625-5059-410f-b80b-9deeb3f93048/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4c303625-5059-410f-b80b-9deeb3f93048/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4c303625-5059-410f-b80b-9deeb3f93048/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4c303625-5059-410f-b80b-9deeb3f93048/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 64bit --witnessprinter.graph.data.programhash 31b6f06b720558e9a2e510f7cce25403bea703ef ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 11:27:50,154 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 11:27:50,155 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 11:27:50,163 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 11:27:50,164 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 11:27:50,164 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 11:27:50,165 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 11:27:50,166 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 11:27:50,167 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 11:27:50,168 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 11:27:50,169 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 11:27:50,169 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 11:27:50,170 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 11:27:50,170 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 11:27:50,171 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 11:27:50,172 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 11:27:50,172 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 11:27:50,174 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 11:27:50,175 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 11:27:50,176 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 11:27:50,177 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 11:27:50,178 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 11:27:50,179 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 11:27:50,180 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 11:27:50,180 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 11:27:50,180 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 11:27:50,181 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 11:27:50,182 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 11:27:50,182 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 11:27:50,183 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 11:27:50,183 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 11:27:50,184 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 11:27:50,184 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 11:27:50,184 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 11:27:50,185 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 11:27:50,185 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 11:27:50,185 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4c303625-5059-410f-b80b-9deeb3f93048/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 11:27:50,196 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 11:27:50,196 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 11:27:50,197 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 11:27:50,197 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 11:27:50,198 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 11:27:50,198 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 11:27:50,198 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 11:27:50,198 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 11:27:50,198 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 11:27:50,198 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 11:27:50,198 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 11:27:50,199 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 11:27:50,199 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 11:27:50,199 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 11:27:50,199 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 11:27:50,199 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 11:27:50,199 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 11:27:50,199 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 11:27:50,200 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 11:27:50,200 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 11:27:50,200 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 11:27:50,200 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 11:27:50,200 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 11:27:50,200 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 11:27:50,200 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 11:27:50,200 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 11:27:50,200 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 11:27:50,200 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 11:27:50,201 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 11:27:50,201 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_4c303625-5059-410f-b80b-9deeb3f93048/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31b6f06b720558e9a2e510f7cce25403bea703ef [2018-12-08 11:27:50,225 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 11:27:50,234 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 11:27:50,237 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 11:27:50,238 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 11:27:50,238 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 11:27:50,238 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4c303625-5059-410f-b80b-9deeb3f93048/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca_true-termination.c.i [2018-12-08 11:27:50,281 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4c303625-5059-410f-b80b-9deeb3f93048/bin-2019/uautomizer/data/00cf61bdc/f54f21349a63463f98cda06c4e2d2d8e/FLAG598d154ba [2018-12-08 11:27:50,715 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 11:27:50,715 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4c303625-5059-410f-b80b-9deeb3f93048/sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca_true-termination.c.i [2018-12-08 11:27:50,720 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4c303625-5059-410f-b80b-9deeb3f93048/bin-2019/uautomizer/data/00cf61bdc/f54f21349a63463f98cda06c4e2d2d8e/FLAG598d154ba [2018-12-08 11:27:50,728 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4c303625-5059-410f-b80b-9deeb3f93048/bin-2019/uautomizer/data/00cf61bdc/f54f21349a63463f98cda06c4e2d2d8e [2018-12-08 11:27:50,730 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 11:27:50,730 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 11:27:50,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 11:27:50,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 11:27:50,733 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 11:27:50,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:27:50" (1/1) ... [2018-12-08 11:27:50,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5243922c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:27:50, skipping insertion in model container [2018-12-08 11:27:50,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:27:50" (1/1) ... [2018-12-08 11:27:50,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 11:27:50,759 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 11:27:50,922 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 11:27:50,928 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 11:27:50,991 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 11:27:51,022 INFO L195 MainTranslator]: Completed translation [2018-12-08 11:27:51,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:27:51 WrapperNode [2018-12-08 11:27:51,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 11:27:51,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 11:27:51,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 11:27:51,023 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 11:27:51,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:27:51" (1/1) ... [2018-12-08 11:27:51,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:27:51" (1/1) ... [2018-12-08 11:27:51,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 11:27:51,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 11:27:51,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 11:27:51,056 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 11:27:51,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:27:51" (1/1) ... [2018-12-08 11:27:51,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:27:51" (1/1) ... [2018-12-08 11:27:51,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:27:51" (1/1) ... [2018-12-08 11:27:51,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:27:51" (1/1) ... [2018-12-08 11:27:51,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:27:51" (1/1) ... [2018-12-08 11:27:51,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:27:51" (1/1) ... [2018-12-08 11:27:51,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:27:51" (1/1) ... [2018-12-08 11:27:51,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 11:27:51,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 11:27:51,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 11:27:51,070 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 11:27:51,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:27:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c303625-5059-410f-b80b-9deeb3f93048/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 11:27:51,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 11:27:51,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 11:27:51,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 11:27:51,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 11:27:51,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 11:27:51,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 11:27:51,230 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 11:27:51,231 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 11:27:51,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:27:51 BoogieIcfgContainer [2018-12-08 11:27:51,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 11:27:51,231 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 11:27:51,231 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 11:27:51,234 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 11:27:51,234 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 11:27:51,234 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 11:27:50" (1/3) ... [2018-12-08 11:27:51,235 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36ed4d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 11:27:51, skipping insertion in model container [2018-12-08 11:27:51,235 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 11:27:51,235 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:27:51" (2/3) ... [2018-12-08 11:27:51,236 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36ed4d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 11:27:51, skipping insertion in model container [2018-12-08 11:27:51,236 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 11:27:51,236 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:27:51" (3/3) ... [2018-12-08 11:27:51,237 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_diffterm_alloca_true-termination.c.i [2018-12-08 11:27:51,270 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 11:27:51,270 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 11:27:51,271 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 11:27:51,271 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 11:27:51,271 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 11:27:51,271 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 11:27:51,271 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 11:27:51,271 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 11:27:51,271 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 11:27:51,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-08 11:27:51,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-08 11:27:51,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 11:27:51,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 11:27:51,297 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 11:27:51,297 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 11:27:51,297 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 11:27:51,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-08 11:27:51,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-08 11:27:51,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 11:27:51,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 11:27:51,299 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 11:27:51,299 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 11:27:51,304 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 6#L369-4true [2018-12-08 11:27:51,304 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 18#L369-1true assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 8#L374true assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 5#L369-3true cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 6#L369-4true [2018-12-08 11:27:51,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:27:51,308 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-08 11:27:51,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:27:51,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:27:51,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:51,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:27:51,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:27:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:27:51,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:27:51,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-12-08 11:27:51,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:27:51,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:27:51,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:51,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:27:51,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:27:51,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 11:27:51,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:27:51,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 11:27:51,417 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 11:27:51,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 11:27:51,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 11:27:51,427 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-12-08 11:27:51,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:27:51,431 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-12-08 11:27:51,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 11:27:51,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-12-08 11:27:51,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-08 11:27:51,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-12-08 11:27:51,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-08 11:27:51,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-08 11:27:51,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-12-08 11:27:51,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 11:27:51,436 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-08 11:27:51,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-12-08 11:27:51,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-08 11:27:51,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-08 11:27:51,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-12-08 11:27:51,452 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-08 11:27:51,453 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-08 11:27:51,453 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 11:27:51,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-12-08 11:27:51,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-08 11:27:51,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 11:27:51,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 11:27:51,454 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 11:27:51,454 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:27:51,454 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 47#L369-4 [2018-12-08 11:27:51,454 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 48#L369-1 assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 56#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; 53#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 54#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210; 44#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 45#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 46#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 47#L369-4 [2018-12-08 11:27:51,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:27:51,454 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-12-08 11:27:51,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:27:51,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:27:51,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:51,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:27:51,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:27:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:27:51,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:27:51,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-12-08 11:27:51,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:27:51,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:27:51,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:51,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:27:51,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:27:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:27:51,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:27:51,491 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-12-08 11:27:51,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:27:51,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:27:51,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:51,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:27:51,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:27:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:27:51,633 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-12-08 11:27:51,771 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-12-08 11:27:51,916 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2018-12-08 11:27:51,989 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 11:27:51,990 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 11:27:51,990 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 11:27:51,990 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 11:27:51,990 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 11:27:51,991 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 11:27:51,991 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 11:27:51,991 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 11:27:51,991 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_diffterm_alloca_true-termination.c.i_Iteration2_Lasso [2018-12-08 11:27:51,991 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 11:27:51,991 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 11:27:52,009 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 11:27:52,013 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 11:27:52,014 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 11:27:52,015 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 11:27:52,280 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 11:27:52,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:52,283 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 11:27:52,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:52,285 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 11:27:52,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:52,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:52,288 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 11:27:52,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:52,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:52,291 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 11:27:52,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:52,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:52,294 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 11:27:52,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:52,296 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 11:27:52,609 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 11:27:52,612 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 11:27:52,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:27:52,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:27:52,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:27:52,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:27:52,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:27:52,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:27:52,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:27:52,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:27:52,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:27:52,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:27:52,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:27:52,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:27:52,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:27:52,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:27:52,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:27:52,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:27:52,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:27:52,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:27:52,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:27:52,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:27:52,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:27:52,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:27:52,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:27:52,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:27:52,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:27:52,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:27:52,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:27:52,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:27:52,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:27:52,622 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 11:27:52,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:27:52,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:27:52,625 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 11:27:52,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 11:27:52,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:27:52,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 11:27:52,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:27:52,637 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 11:27:52,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:27:52,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:27:52,639 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 11:27:52,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 11:27:52,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:27:52,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:27:52,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:27:52,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:27:52,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:27:52,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:27:52,647 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 11:27:52,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 11:27:52,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:27:52,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:27:52,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:27:52,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:27:52,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:27:52,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:27:52,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 11:27:52,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 11:27:52,665 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 11:27:52,678 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 11:27:52,678 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-08 11:27:52,679 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 11:27:52,680 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 11:27:52,680 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 11:27:52,681 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0.offset, v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0.base)_1) = -1*ULTIMATE.start_cstrpbrk_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0.base)_1 Supporting invariants [] [2018-12-08 11:27:52,705 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-12-08 11:27:52,709 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 11:27:52,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:27:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:27:52,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:27:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:27:52,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:27:52,748 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 11:27:52,750 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 11:27:52,750 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-08 11:27:52,777 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2018-12-08 11:27:52,777 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 11:27:52,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 11:27:52,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-08 11:27:52,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-08 11:27:52,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:27:52,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-12-08 11:27:52,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:27:52,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-12-08 11:27:52,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:27:52,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-12-08 11:27:52,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 11:27:52,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-12-08 11:27:52,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 11:27:52,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-08 11:27:52,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-12-08 11:27:52,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 11:27:52,782 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-08 11:27:52,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-12-08 11:27:52,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-08 11:27:52,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-08 11:27:52,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-12-08 11:27:52,784 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-08 11:27:52,784 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-08 11:27:52,784 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 11:27:52,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-12-08 11:27:52,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 11:27:52,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 11:27:52,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 11:27:52,785 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:27:52,785 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 11:27:52,785 INFO L794 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 182#L382 assume !(main_~length1~0 < 1); 183#L382-2 assume !(main_~length2~0 < 1); 180#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 177#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 179#L369-1 assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 189#L372-5 [2018-12-08 11:27:52,785 INFO L796 eck$LassoCheckResult]: Loop: 189#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; 184#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 185#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 189#L372-5 [2018-12-08 11:27:52,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:27:52,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-12-08 11:27:52,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:27:52,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:27:52,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:52,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:27:52,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:27:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:27:52,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:27:52,799 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-12-08 11:27:52,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:27:52,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:27:52,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:52,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:27:52,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:27:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:27:52,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:27:52,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-12-08 11:27:52,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:27:52,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:27:52,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:52,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:27:52,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:27:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:27:53,117 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 101 [2018-12-08 11:27:53,189 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 11:27:53,189 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 11:27:53,189 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 11:27:53,189 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 11:27:53,189 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 11:27:53,189 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 11:27:53,189 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 11:27:53,189 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 11:27:53,189 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_diffterm_alloca_true-termination.c.i_Iteration3_Lasso [2018-12-08 11:27:53,189 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 11:27:53,189 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 11:27:53,192 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 11:27:53,193 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 11:27:53,194 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 11:27:53,396 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2018-12-08 11:27:53,452 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 11:27:53,454 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 11:27:53,454 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 11:27:53,455 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 11:27:53,456 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 11:27:53,457 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 11:27:53,459 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 11:27:53,460 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 11:27:53,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:53,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:53,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:53,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:53,464 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 11:27:53,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:53,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:53,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:53,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:53,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:53,800 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-12-08 11:27:53,825 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 11:27:53,825 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 11:27:53,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 11:27:53,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:27:53,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:27:53,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:27:53,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:27:53,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:27:53,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:27:53,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:27:53,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:27:53,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 11:27:53,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:27:53,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:27:53,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:27:53,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:27:53,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:27:53,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:27:53,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:27:53,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:27:53,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:27:53,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:27:53,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:27:53,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:27:53,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:27:53,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 11:27:53,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 11:27:53,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:27:53,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 11:27:53,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:27:53,832 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 11:27:53,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:27:53,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:27:53,833 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 11:27:53,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 11:27:53,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:27:53,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:27:53,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:27:53,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:27:53,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:27:53,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:27:53,843 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 11:27:53,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 11:27:53,859 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 11:27:53,873 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 11:27:53,873 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-08 11:27:53,874 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 11:27:53,875 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 11:27:53,875 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 11:27:53,875 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2 Supporting invariants [] [2018-12-08 11:27:53,912 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2018-12-08 11:27:53,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 11:27:53,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:27:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:27:53,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:27:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:27:53,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:27:53,957 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 11:27:53,957 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 11:27:53,958 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-12-08 11:27:53,991 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2018-12-08 11:27:53,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 11:27:53,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 11:27:53,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-08 11:27:53,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-08 11:27:53,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:27:53,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-08 11:27:53,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:27:53,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-08 11:27:53,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:27:53,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-12-08 11:27:53,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 11:27:53,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-12-08 11:27:53,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-08 11:27:53,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-08 11:27:53,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-12-08 11:27:53,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 11:27:53,995 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-12-08 11:27:53,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-12-08 11:27:53,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-08 11:27:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-08 11:27:53,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-12-08 11:27:53,997 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-08 11:27:53,997 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-08 11:27:53,997 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 11:27:53,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-12-08 11:27:53,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 11:27:53,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 11:27:53,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 11:27:53,999 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:27:53,999 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 11:27:53,999 INFO L794 eck$LassoCheckResult]: Stem: 377#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 370#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 371#L382 assume !(main_~length1~0 < 1); 372#L382-2 assume !(main_~length2~0 < 1); 369#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 365#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 366#L369-1 assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 379#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; 375#L372-1 assume !cstrpbrk_#t~short210; 376#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210; 361#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 362#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 363#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 364#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 368#L369-1 assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 378#L372-5 [2018-12-08 11:27:53,999 INFO L796 eck$LassoCheckResult]: Loop: 378#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; 373#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 374#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 378#L372-5 [2018-12-08 11:27:53,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:27:53,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-12-08 11:27:53,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:27:53,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:27:54,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:54,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:27:54,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:27:54,042 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 11:27:54,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:27:54,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 11:27:54,042 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 11:27:54,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:27:54,043 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-12-08 11:27:54,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:27:54,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:27:54,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:54,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:27:54,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:27:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:27:54,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 11:27:54,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 11:27:54,154 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-08 11:27:54,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:27:54,208 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2018-12-08 11:27:54,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 11:27:54,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2018-12-08 11:27:54,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 11:27:54,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2018-12-08 11:27:54,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-08 11:27:54,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-08 11:27:54,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-12-08 11:27:54,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 11:27:54,210 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-08 11:27:54,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-12-08 11:27:54,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-12-08 11:27:54,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-08 11:27:54,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-12-08 11:27:54,213 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-12-08 11:27:54,213 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-12-08 11:27:54,213 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 11:27:54,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-12-08 11:27:54,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 11:27:54,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 11:27:54,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 11:27:54,214 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:27:54,214 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 11:27:54,214 INFO L794 eck$LassoCheckResult]: Stem: 445#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 442#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 443#L382 assume !(main_~length1~0 < 1); 444#L382-2 assume !(main_~length2~0 < 1); 441#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 437#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 438#L369-1 assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 451#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; 455#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 454#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210; 433#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 434#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 435#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 436#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 439#L369-1 assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 450#L372-5 [2018-12-08 11:27:54,215 INFO L796 eck$LassoCheckResult]: Loop: 450#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; 446#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 447#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 450#L372-5 [2018-12-08 11:27:54,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:27:54,215 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-12-08 11:27:54,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:27:54,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:27:54,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:54,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:27:54,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:27:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:27:54,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:27:54,237 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-12-08 11:27:54,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:27:54,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:27:54,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:54,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:27:54,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:27:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:27:54,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:27:54,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-12-08 11:27:54,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:27:54,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:27:54,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:54,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:27:54,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:27:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:27:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:27:54,775 WARN L180 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 134 [2018-12-08 11:27:55,423 WARN L180 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 106 [2018-12-08 11:27:55,425 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 11:27:55,425 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 11:27:55,425 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 11:27:55,425 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 11:27:55,425 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 11:27:55,425 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 11:27:55,425 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 11:27:55,425 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 11:27:55,425 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_diffterm_alloca_true-termination.c.i_Iteration5_Lasso [2018-12-08 11:27:55,425 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 11:27:55,425 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 11:27:55,429 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 11:27:55,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:55,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:55,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:55,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:55,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:55,439 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 11:27:55,563 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-08 11:27:55,919 WARN L180 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-12-08 11:27:55,992 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 11:27:55,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:55,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:27:55,994 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 11:27:55,996 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 11:27:55,997 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 11:27:55,997 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 11:27:55,998 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 11:27:55,999 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 11:27:56,000 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 11:27:56,000 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 11:27:56,001 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 11:27:56,002 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 11:27:56,326 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 112 [2018-12-08 11:27:59,110 WARN L180 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 137 DAG size of output: 116 [2018-12-08 11:27:59,839 WARN L180 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2018-12-08 11:27:59,872 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 11:27:59,872 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 11:27:59,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:27:59,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:27:59,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:27:59,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:27:59,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:27:59,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:27:59,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:27:59,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:27:59,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:27:59,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:27:59,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:27:59,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:27:59,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:27:59,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:27:59,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:27:59,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:27:59,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:27:59,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:27:59,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 11:27:59,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:27:59,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:27:59,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:27:59,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:27:59,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:27:59,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:27:59,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:27:59,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:27:59,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:27:59,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:27:59,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:27:59,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:27:59,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:27:59,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:27:59,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:27:59,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:27:59,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:27:59,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:27:59,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:27:59,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:27:59,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:27:59,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:27:59,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:27:59,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:27:59,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:27:59,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:27:59,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:27:59,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:27:59,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:27:59,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:27:59,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:27:59,885 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 11:27:59,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 11:27:59,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:27:59,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:27:59,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:27:59,887 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 11:27:59,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:27:59,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:27:59,888 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 11:27:59,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 11:27:59,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:27:59,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 11:27:59,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:27:59,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:27:59,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:27:59,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:27:59,894 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 11:27:59,894 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 11:27:59,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:27:59,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 11:27:59,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:27:59,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:27:59,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:27:59,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:27:59,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 11:27:59,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 11:27:59,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:27:59,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:27:59,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:27:59,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:27:59,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:27:59,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:27:59,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 11:27:59,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 11:27:59,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:27:59,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:27:59,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:27:59,903 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-12-08 11:27:59,903 INFO L206 nArgumentSynthesizer]: 7 loop disjuncts [2018-12-08 11:27:59,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:28:00,034 INFO L402 nArgumentSynthesizer]: We have 280 Motzkin's Theorem applications. [2018-12-08 11:28:00,034 INFO L403 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2018-12-08 11:28:04,889 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 11:28:07,401 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2018-12-08 11:28:07,401 INFO L444 ModelExtractionUtils]: 389 out of 406 variables were initially zero. Simplification set additionally 14 variables to zero. [2018-12-08 11:28:07,401 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 11:28:07,404 INFO L440 nArgumentSynthesizer]: Removed 14 redundant supporting invariants from a total of 14. [2018-12-08 11:28:07,404 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 11:28:07,404 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_3) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_3 Supporting invariants [] [2018-12-08 11:28:07,482 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2018-12-08 11:28:07,483 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 11:28:07,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:28:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:28:07,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:28:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:28:07,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:28:07,510 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 11:28:07,510 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 11:28:07,510 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-08 11:28:07,524 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2018-12-08 11:28:07,524 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 11:28:07,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 11:28:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-12-08 11:28:07,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-08 11:28:07,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:28:07,525 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 11:28:07,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:28:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:28:07,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:28:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:28:07,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:28:07,563 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 11:28:07,563 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 11:28:07,563 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-08 11:28:07,574 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2018-12-08 11:28:07,574 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 11:28:07,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 11:28:07,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-12-08 11:28:07,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-08 11:28:07,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:28:07,575 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 11:28:07,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:28:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:28:07,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:28:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:28:07,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:28:07,603 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 11:28:07,603 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 11:28:07,603 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-08 11:28:07,614 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 53 transitions. Complement of second has 4 states. [2018-12-08 11:28:07,614 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 11:28:07,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 11:28:07,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-12-08 11:28:07,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-08 11:28:07,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:28:07,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-08 11:28:07,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:28:07,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-08 11:28:07,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:28:07,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-12-08 11:28:07,616 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 11:28:07,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-12-08 11:28:07,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 11:28:07,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 11:28:07,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 11:28:07,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 11:28:07,616 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 11:28:07,616 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 11:28:07,616 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 11:28:07,617 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 11:28:07,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 11:28:07,617 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 11:28:07,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 11:28:07,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 11:28:07 BoogieIcfgContainer [2018-12-08 11:28:07,621 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 11:28:07,621 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 11:28:07,621 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 11:28:07,621 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 11:28:07,621 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:27:51" (3/4) ... [2018-12-08 11:28:07,624 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 11:28:07,624 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 11:28:07,625 INFO L168 Benchmark]: Toolchain (without parser) took 16894.67 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 957.1 MB in the beginning and 1.2 GB in the end (delta: -221.8 MB). Peak memory consumption was 966.2 MB. Max. memory is 11.5 GB. [2018-12-08 11:28:07,625 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 11:28:07,626 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -121.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-08 11:28:07,626 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.84 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 11:28:07,627 INFO L168 Benchmark]: Boogie Preprocessor took 14.42 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 11:28:07,627 INFO L168 Benchmark]: RCFGBuilder took 160.89 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 11:28:07,627 INFO L168 Benchmark]: BuchiAutomizer took 16389.29 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -150.3 MB). Peak memory consumption was 942.8 MB. Max. memory is 11.5 GB. [2018-12-08 11:28:07,627 INFO L168 Benchmark]: Witness Printer took 3.31 ms. Allocated memory is still 2.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2018-12-08 11:28:07,629 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 291.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -121.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.84 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.42 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 160.89 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 16389.29 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -150.3 MB). Peak memory consumption was 942.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.31 ms. Allocated memory is still 2.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[sc1] and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 15.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 108 SDtfs, 129 SDslu, 57 SDs, 0 SdLazy, 96 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital367 mio100 ax100 hnf99 lsp91 ukn71 mio100 lsp61 div120 bol100 ite100 ukn100 eq174 hnf82 smp78 dnf1125 smp33 tf100 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 7501ms VariablesStem: 28 VariablesLoop: 18 DisjunctsStem: 12 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 280 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...