./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d8e35cfa-a145-491c-a709-089a3c4b3895/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d8e35cfa-a145-491c-a709-089a3c4b3895/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d8e35cfa-a145-491c-a709-089a3c4b3895/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d8e35cfa-a145-491c-a709-089a3c4b3895/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_d8e35cfa-a145-491c-a709-089a3c4b3895/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d8e35cfa-a145-491c-a709-089a3c4b3895/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-aa41828 [2018-11-22 23:08:24,238 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:08:24,239 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:08:24,248 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:08:24,248 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:08:24,249 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:08:24,250 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:08:24,251 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:08:24,253 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:08:24,254 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:08:24,254 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:08:24,255 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:08:24,255 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:08:24,256 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:08:24,257 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:08:24,258 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:08:24,258 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:08:24,260 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:08:24,261 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:08:24,263 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:08:24,264 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:08:24,265 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:08:24,267 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:08:24,267 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:08:24,267 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:08:24,268 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:08:24,269 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:08:24,269 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:08:24,270 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:08:24,270 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:08:24,270 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:08:24,271 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:08:24,271 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:08:24,271 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:08:24,272 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:08:24,272 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:08:24,272 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d8e35cfa-a145-491c-a709-089a3c4b3895/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-22 23:08:24,281 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:08:24,281 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:08:24,282 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 23:08:24,282 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 23:08:24,282 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 23:08:24,282 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 23:08:24,283 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 23:08:24,283 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 23:08:24,283 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 23:08:24,283 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 23:08:24,283 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 23:08:24,283 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:08:24,284 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 23:08:24,284 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:08:24,284 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:08:24,284 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 23:08:24,284 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 23:08:24,284 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 23:08:24,284 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:08:24,285 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 23:08:24,285 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:08:24,285 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 23:08:24,285 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:08:24,285 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:08:24,286 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 23:08:24,286 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:08:24,286 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 23:08:24,286 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 23:08:24,287 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 23:08:24,287 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_d8e35cfa-a145-491c-a709-089a3c4b3895/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-11-22 23:08:24,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:08:24,324 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:08:24,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:08:24,328 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:08:24,328 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:08:24,329 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d8e35cfa-a145-491c-a709-089a3c4b3895/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca_true-termination.c.i [2018-11-22 23:08:24,374 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d8e35cfa-a145-491c-a709-089a3c4b3895/bin-2019/uautomizer/data/038aaa8f8/94e020b7bd694b978586966f9a003301/FLAGc9dc08fda [2018-11-22 23:08:24,787 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:08:24,788 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d8e35cfa-a145-491c-a709-089a3c4b3895/sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca_true-termination.c.i [2018-11-22 23:08:24,796 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d8e35cfa-a145-491c-a709-089a3c4b3895/bin-2019/uautomizer/data/038aaa8f8/94e020b7bd694b978586966f9a003301/FLAGc9dc08fda [2018-11-22 23:08:24,810 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d8e35cfa-a145-491c-a709-089a3c4b3895/bin-2019/uautomizer/data/038aaa8f8/94e020b7bd694b978586966f9a003301 [2018-11-22 23:08:24,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:08:24,815 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:08:24,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:08:24,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:08:24,819 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:08:24,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:08:24" (1/1) ... [2018-11-22 23:08:24,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa062a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:24, skipping insertion in model container [2018-11-22 23:08:24,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:08:24" (1/1) ... [2018-11-22 23:08:24,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:08:24,866 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:08:25,105 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:08:25,112 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:08:25,194 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:08:25,226 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:08:25,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:25 WrapperNode [2018-11-22 23:08:25,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:08:25,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:08:25,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:08:25,227 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:08:25,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:25" (1/1) ... [2018-11-22 23:08:25,243 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:25" (1/1) ... [2018-11-22 23:08:25,259 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:08:25,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:08:25,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:08:25,260 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:08:25,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:25" (1/1) ... [2018-11-22 23:08:25,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:25" (1/1) ... [2018-11-22 23:08:25,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:25" (1/1) ... [2018-11-22 23:08:25,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:25" (1/1) ... [2018-11-22 23:08:25,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:25" (1/1) ... [2018-11-22 23:08:25,277 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:25" (1/1) ... [2018-11-22 23:08:25,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:25" (1/1) ... [2018-11-22 23:08:25,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:08:25,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:08:25,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:08:25,280 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:08:25,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8e35cfa-a145-491c-a709-089a3c4b3895/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:08:25,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 23:08:25,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 23:08:25,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 23:08:25,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 23:08:25,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:08:25,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:08:25,515 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:08:25,516 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-22 23:08:25,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:08:25 BoogieIcfgContainer [2018-11-22 23:08:25,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:08:25,517 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 23:08:25,517 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 23:08:25,520 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 23:08:25,521 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:08:25,521 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 11:08:24" (1/3) ... [2018-11-22 23:08:25,522 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e22e334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 11:08:25, skipping insertion in model container [2018-11-22 23:08:25,522 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:08:25,522 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:25" (2/3) ... [2018-11-22 23:08:25,522 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e22e334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 11:08:25, skipping insertion in model container [2018-11-22 23:08:25,522 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:08:25,522 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:08:25" (3/3) ... [2018-11-22 23:08:25,524 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_diffterm_alloca_true-termination.c.i [2018-11-22 23:08:25,570 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 23:08:25,570 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 23:08:25,570 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 23:08:25,570 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 23:08:25,570 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:08:25,571 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:08:25,571 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 23:08:25,571 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:08:25,571 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 23:08:25,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-22 23:08:25,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-22 23:08:25,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:08:25,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:08:25,606 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 23:08:25,606 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-22 23:08:25,606 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 23:08:25,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-22 23:08:25,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-22 23:08:25,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:08:25,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:08:25,609 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 23:08:25,609 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-22 23:08:25,617 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-11-22 23:08:25,617 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-11-22 23:08:25,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:25,623 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-22 23:08:25,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:25,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:25,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:25,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:25,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:08:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:08:25,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:25,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-11-22 23:08:25,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:25,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:25,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:25,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:25,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:25,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:08:25,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:08:25,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 23:08:25,769 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 23:08:25,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 23:08:25,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 23:08:25,782 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-22 23:08:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:08:25,788 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-22 23:08:25,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 23:08:25,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-22 23:08:25,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-22 23:08:25,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-11-22 23:08:25,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-22 23:08:25,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-22 23:08:25,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-22 23:08:25,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:08:25,796 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-22 23:08:25,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-22 23:08:25,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-22 23:08:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-22 23:08:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-22 23:08:25,817 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-22 23:08:25,817 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-22 23:08:25,817 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 23:08:25,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-22 23:08:25,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-22 23:08:25,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:08:25,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:08:25,818 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 23:08:25,818 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:08:25,819 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-11-22 23:08:25,819 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~mem208;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209; 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-11-22 23:08:25,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:25,819 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-22 23:08:25,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:25,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:25,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:25,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:25,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:08:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:08:25,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:25,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-11-22 23:08:25,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:25,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:25,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:25,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:08:25,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:08:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:08:25,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:25,877 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-11-22 23:08:25,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:25,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:25,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:25,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:25,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:08:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:08:26,114 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-11-22 23:08:26,287 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-11-22 23:08:26,449 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-11-22 23:08:26,526 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 23:08:26,527 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 23:08:26,527 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 23:08:26,527 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 23:08:26,527 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 23:08:26,528 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:08:26,528 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 23:08:26,528 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 23:08:26,528 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_diffterm_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-22 23:08:26,528 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 23:08:26,529 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 23:08:26,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:26,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:26,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:26,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:26,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:26,764 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2018-11-22 23:08:26,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:26,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:26,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:26,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:26,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:26,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:26,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:26,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:26,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:26,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:26,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:26,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:26,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:26,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:26,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:27,281 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2018-11-22 23:08:27,328 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 23:08:27,332 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 23:08:27,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:27,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:27,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:08:27,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:27,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:27,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:27,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:08:27,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:08:27,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:27,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:27,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:27,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:08:27,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:27,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:27,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:27,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:08:27,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:08:27,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:27,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:27,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:27,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:08:27,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:27,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:27,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:27,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:08:27,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:08:27,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:27,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:27,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:27,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:27,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:27,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:27,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:08:27,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:08:27,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:27,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:27,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:27,350 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:08:27,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:27,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:27,355 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:08:27,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:08:27,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:27,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:27,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:27,376 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:08:27,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:27,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:27,380 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:08:27,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:08:27,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:27,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:27,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:27,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:27,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:27,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:27,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:08:27,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:08:27,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:27,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:27,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:27,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:27,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:27,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:27,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:08:27,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:08:27,433 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 23:08:27,455 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-22 23:08:27,455 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-22 23:08:27,457 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 23:08:27,458 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 23:08:27,459 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 23:08:27,459 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-11-22 23:08:27,501 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-22 23:08:27,507 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 23:08:27,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:27,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:08:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:27,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:08:27,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:08:27,573 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 23:08:27,574 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-22 23:08:27,613 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-11-22 23:08:27,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-11-22 23:08:27,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 23:08:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-11-22 23:08:27,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-22 23:08:27,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:08:27,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-22 23:08:27,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:08:27,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-22 23:08:27,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:08:27,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-22 23:08:27,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 23:08:27,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-11-22 23:08:27,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-22 23:08:27,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-22 23:08:27,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-22 23:08:27,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 23:08:27,621 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-22 23:08:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-22 23:08:27,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-22 23:08:27,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-22 23:08:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-22 23:08:27,622 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-22 23:08:27,622 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-22 23:08:27,623 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 23:08:27,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-22 23:08:27,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 23:08:27,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:08:27,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:08:27,624 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:08:27,624 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 23:08:27,624 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-11-22 23:08:27,624 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~mem208;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;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-11-22 23:08:27,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:27,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-22 23:08:27,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:27,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:27,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:27,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:27,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:08:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:08:27,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:27,650 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-11-22 23:08:27,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:27,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:27,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:27,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:27,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:08:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:08:27,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:27,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-11-22 23:08:27,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:27,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:27,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:27,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:27,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:08:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:08:28,011 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 96 [2018-11-22 23:08:28,086 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 23:08:28,086 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 23:08:28,086 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 23:08:28,086 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 23:08:28,086 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 23:08:28,086 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:08:28,086 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 23:08:28,086 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 23:08:28,086 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_diffterm_alloca_true-termination.c.i_Iteration3_Lasso [2018-11-22 23:08:28,087 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 23:08:28,087 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 23:08:28,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:28,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:28,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:28,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:28,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:28,300 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2018-11-22 23:08:28,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:28,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:28,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:28,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:28,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:28,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:28,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:28,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:28,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:28,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:28,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:28,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:28,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:28,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:28,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:28,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:28,792 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-11-22 23:08:28,818 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 23:08:28,818 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 23:08:28,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:28,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:28,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:08:28,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:28,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:28,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:28,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:08:28,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:08:28,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:28,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:28,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:28,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:08:28,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:28,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:28,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:28,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:08:28,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:08:28,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:28,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:28,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:28,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:28,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:28,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:28,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:08:28,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:08:28,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:28,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-11-22 23:08:28,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:28,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:08:28,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:28,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:28,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:28,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:08:28,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:08:28,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:28,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-11-22 23:08:28,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:28,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:28,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:28,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:28,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:08:28,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:08:28,854 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 23:08:28,866 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-22 23:08:28,866 INFO L444 ModelExtractionUtils]: 44 out of 49 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-22 23:08:28,866 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 23:08:28,867 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 23:08:28,868 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 23:08:28,868 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-11-22 23:08:28,931 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-22 23:08:28,933 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 23:08:28,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:28,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:08:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:28,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:08:29,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:08:29,005 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-22 23:08:29,005 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-22 23:08:29,047 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-11-22 23:08:29,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 23:08:29,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 23:08:29,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-22 23:08:29,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-22 23:08:29,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:08:29,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-22 23:08:29,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:08:29,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-22 23:08:29,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:08:29,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-22 23:08:29,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 23:08:29,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-11-22 23:08:29,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-22 23:08:29,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-22 23:08:29,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-22 23:08:29,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 23:08:29,052 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-22 23:08:29,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-22 23:08:29,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-22 23:08:29,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-22 23:08:29,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-11-22 23:08:29,054 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-22 23:08:29,054 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-22 23:08:29,054 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 23:08:29,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-11-22 23:08:29,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 23:08:29,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:08:29,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:08:29,056 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:08:29,056 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 23:08:29,056 INFO L794 eck$LassoCheckResult]: Stem: 369#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 362#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; 363#L382 assume !(main_~length1~0 < 1); 364#L382-2 assume !(main_~length2~0 < 1); 361#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; 357#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 358#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; 371#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; 367#L372-1 assume !cstrpbrk_#t~short210; 368#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209; 353#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 354#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 355#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; 356#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 360#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; 370#L372-5 [2018-11-22 23:08:29,056 INFO L796 eck$LassoCheckResult]: Loop: 370#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; 365#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); 366#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;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; 370#L372-5 [2018-11-22 23:08:29,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:29,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-11-22 23:08:29,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:29,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:29,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:29,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:29,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:29,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:08:29,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:08:29,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-22 23:08:29,111 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:08:29,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:29,111 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-11-22 23:08:29,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:29,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:29,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:29,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:29,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:08:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:08:29,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 23:08:29,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-22 23:08:29,220 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-22 23:08:29,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:08:29,272 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2018-11-22 23:08:29,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 23:08:29,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2018-11-22 23:08:29,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 23:08:29,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2018-11-22 23:08:29,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-22 23:08:29,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-22 23:08:29,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-11-22 23:08:29,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 23:08:29,275 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-22 23:08:29,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-11-22 23:08:29,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-22 23:08:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-22 23:08:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-11-22 23:08:29,277 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-22 23:08:29,277 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-22 23:08:29,278 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-22 23:08:29,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-11-22 23:08:29,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 23:08:29,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:08:29,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:08:29,279 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:08:29,279 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 23:08:29,279 INFO L794 eck$LassoCheckResult]: Stem: 437#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 434#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; 435#L382 assume !(main_~length1~0 < 1); 436#L382-2 assume !(main_~length2~0 < 1); 433#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; 429#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 430#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; 443#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; 447#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); 446#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209; 425#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 426#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 427#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; 428#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 432#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; 442#L372-5 [2018-11-22 23:08:29,279 INFO L796 eck$LassoCheckResult]: Loop: 442#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; 438#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); 439#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;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; 442#L372-5 [2018-11-22 23:08:29,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:29,280 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-11-22 23:08:29,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:29,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:29,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:29,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:08:29,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:08:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:08:29,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:29,301 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-11-22 23:08:29,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:29,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:29,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:29,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:08:29,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:08:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:08:29,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:29,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-11-22 23:08:29,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:29,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:29,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:29,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:08:29,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:08:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:08:29,836 WARN L180 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 130 [2018-11-22 23:08:30,437 WARN L180 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 107 [2018-11-22 23:08:30,438 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 23:08:30,439 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 23:08:30,439 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 23:08:30,439 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 23:08:30,439 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 23:08:30,439 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:08:30,439 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 23:08:30,439 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 23:08:30,439 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_diffterm_alloca_true-termination.c.i_Iteration5_Lasso [2018-11-22 23:08:30,439 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 23:08:30,439 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 23:08:30,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:30,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:30,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:30,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-11-22 23:08:30,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-11-22 23:08:30,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-11-22 23:08:30,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-11-22 23:08:30,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-11-22 23:08:30,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:30,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:30,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:30,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:30,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:30,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:30,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:30,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:30,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:30,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:30,644 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-22 23:08:31,063 WARN L180 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 94 [2018-11-22 23:08:31,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:31,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:08:31,662 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2018-11-22 23:08:31,786 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-11-22 23:08:31,898 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 23:08:31,898 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 23:08:31,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-11-22 23:08:31,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:31,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:08:31,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:31,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:31,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:31,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:08:31,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:08:31,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:31,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:31,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:31,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:08:31,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:31,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:31,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:31,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:08:31,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:08:31,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:31,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:31,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:31,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:08:31,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:31,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:31,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:31,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:08:31,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:08:31,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:31,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:31,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:31,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:08:31,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:31,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:31,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:31,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:08:31,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:08:31,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:31,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:31,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:31,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:31,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:31,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:31,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:08:31,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:08:31,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:31,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:31,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:31,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:08:31,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:31,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:31,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:31,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:08:31,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:08:31,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:31,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:31,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:31,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:08:31,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:31,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:31,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:31,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:08:31,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:08:31,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:31,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:31,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:31,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:08:31,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:31,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:31,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:31,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:08:31,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:08:31,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:31,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:31,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:31,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:08:31,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:31,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:31,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:31,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:08:31,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:08:31,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:31,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:31,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:31,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:31,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:31,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:31,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:08:31,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:08:31,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:31,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:31,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:31,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:08:31,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:31,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:31,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:31,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:08:31,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:08:31,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:31,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:31,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:31,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:08:31,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:31,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:31,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:31,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:08:31,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:08:31,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:31,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:31,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:31,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:08:31,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:31,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:31,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:31,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:08:31,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:08:31,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:31,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:31,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:31,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:08:31,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:31,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:31,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:31,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:08:31,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:08:31,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:31,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:31,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:31,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:08:31,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:31,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:31,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:31,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:08:31,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:08:31,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:31,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:31,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:31,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:08:31,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:31,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:31,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:31,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:08:31,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:08:31,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:31,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:31,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:31,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:08:31,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:31,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:31,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:31,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:08:31,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:08:31,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:31,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:31,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:31,932 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:08:31,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:31,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:31,933 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:08:31,934 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:08:31,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:31,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:31,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:31,940 INFO L205 nArgumentSynthesizer]: 6 stem disjuncts [2018-11-22 23:08:31,941 INFO L206 nArgumentSynthesizer]: 7 loop disjuncts [2018-11-22 23:08:31,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:31,979 INFO L402 nArgumentSynthesizer]: We have 196 Motzkin's Theorem applications. [2018-11-22 23:08:31,979 INFO L403 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2018-11-22 23:08:32,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:32,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:32,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:32,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:32,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:32,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:32,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:08:32,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:08:32,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:32,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:32,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:32,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:32,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:32,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:32,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:08:32,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:08:32,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:32,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:32,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:32,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:32,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:32,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:32,147 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:08:32,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:08:32,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:32,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:32,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:32,149 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:08:32,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:32,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:32,151 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:08:32,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:08:32,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:08:32,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:08:32,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:08:32,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:08:32,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:08:32,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:08:32,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:08:32,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:08:32,181 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 23:08:32,191 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-22 23:08:32,191 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 23:08:32,191 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 23:08:32,192 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 23:08:32,192 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 23:08:32,192 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2018-11-22 23:08:32,362 INFO L297 tatePredicateManager]: 30 out of 31 supporting invariants were superfluous and have been removed [2018-11-22 23:08:32,364 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 23:08:32,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:32,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:08:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:32,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:08:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:08:32,475 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-22 23:08:32,475 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-22 23:08:32,545 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-11-22 23:08:32,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 23:08:32,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 23:08:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-22 23:08:32,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-22 23:08:32,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:08:32,547 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 23:08:32,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:32,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:08:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:32,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:08:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:08:32,668 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-22 23:08:32,668 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-22 23:08:32,704 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-11-22 23:08:32,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 23:08:32,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 23:08:32,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-22 23:08:32,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-22 23:08:32,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:08:32,712 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 23:08:32,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:32,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:08:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:32,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:08:32,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:08:32,781 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-22 23:08:32,781 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-22 23:08:32,810 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 53 transitions. Complement of second has 5 states. [2018-11-22 23:08:32,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 23:08:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 23:08:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-22 23:08:32,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-22 23:08:32,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:08:32,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-22 23:08:32,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:08:32,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-22 23:08:32,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:08:32,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-11-22 23:08:32,814 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 23:08:32,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-11-22 23:08:32,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-22 23:08:32,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-22 23:08:32,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-22 23:08:32,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:08:32,815 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 23:08:32,815 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 23:08:32,815 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 23:08:32,815 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-22 23:08:32,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-22 23:08:32,815 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 23:08:32,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-22 23:08:32,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 11:08:32 BoogieIcfgContainer [2018-11-22 23:08:32,821 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 23:08:32,821 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:08:32,821 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:08:32,821 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:08:32,822 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:08:25" (3/4) ... [2018-11-22 23:08:32,824 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 23:08:32,825 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:08:32,825 INFO L168 Benchmark]: Toolchain (without parser) took 8011.54 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.4 MB). Free memory was 956.5 MB in the beginning and 1.0 GB in the end (delta: -64.4 MB). Peak memory consumption was 160.0 MB. Max. memory is 11.5 GB. [2018-11-22 23:08:32,826 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:08:32,826 INFO L168 Benchmark]: CACSL2BoogieTranslator took 411.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 956.5 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-22 23:08:32,827 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:08:32,829 INFO L168 Benchmark]: Boogie Preprocessor took 20.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:08:32,829 INFO L168 Benchmark]: RCFGBuilder took 236.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-22 23:08:32,830 INFO L168 Benchmark]: BuchiAutomizer took 7303.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.2 MB). Peak memory consumption was 161.9 MB. Max. memory is 11.5 GB. [2018-11-22 23:08:32,830 INFO L168 Benchmark]: Witness Printer took 3.63 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:08:32,833 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 411.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 956.5 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 236.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7303.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.2 MB). Peak memory consumption was 161.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.63 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + -1 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 6.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. 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: 105 SDtfs, 104 SDslu, 72 SDs, 0 SdLazy, 105 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital367 mio100 ax100 hnf99 lsp91 ukn71 mio100 lsp33 div131 bol100 ite100 ukn100 eq166 hnf77 smp87 dnf712 smp32 tf100 neg95 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 198ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 6 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 196 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...