./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_42b68867-c185-4f37-959e-7801ec18086e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_42b68867-c185-4f37-959e-7801ec18086e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_42b68867-c185-4f37-959e-7801ec18086e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_42b68867-c185-4f37-959e-7801ec18086e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_42b68867-c185-4f37-959e-7801ec18086e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_42b68867-c185-4f37-959e-7801ec18086e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 61682d2c31dd7110d61be8ccb8e4bbb3882eca20 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 03:53:33,051 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:53:33,052 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:53:33,058 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:53:33,058 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:53:33,059 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:53:33,060 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:53:33,061 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:53:33,062 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:53:33,063 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:53:33,063 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:53:33,063 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:53:33,064 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:53:33,065 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:53:33,065 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:53:33,066 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:53:33,067 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:53:33,068 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:53:33,069 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:53:33,070 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:53:33,071 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:53:33,072 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:53:33,073 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:53:33,074 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:53:33,074 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:53:33,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:53:33,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:53:33,076 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:53:33,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:53:33,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:53:33,077 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:53:33,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:53:33,078 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:53:33,078 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:53:33,078 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:53:33,079 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:53:33,079 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_42b68867-c185-4f37-959e-7801ec18086e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 03:53:33,087 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:53:33,087 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:53:33,088 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:53:33,088 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:53:33,089 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:53:33,089 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 03:53:33,089 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 03:53:33,089 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 03:53:33,089 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 03:53:33,089 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 03:53:33,089 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 03:53:33,090 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:53:33,090 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:53:33,090 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 03:53:33,090 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:53:33,090 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:53:33,090 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:53:33,090 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 03:53:33,090 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 03:53:33,091 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 03:53:33,091 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:53:33,091 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:53:33,091 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 03:53:33,091 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 03:53:33,091 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:53:33,091 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:53:33,092 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 03:53:33,092 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:53:33,092 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:53:33,092 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 03:53:33,093 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 03:53:33,093 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_42b68867-c185-4f37-959e-7801ec18086e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 61682d2c31dd7110d61be8ccb8e4bbb3882eca20 [2018-11-10 03:53:33,115 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:53:33,124 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:53:33,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:53:33,128 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:53:33,128 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:53:33,128 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_42b68867-c185-4f37-959e-7801ec18086e/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-10 03:53:33,170 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_42b68867-c185-4f37-959e-7801ec18086e/bin-2019/uautomizer/data/bdc30aa9d/8aa1e6ca958b4066877a9c23f25a1bb5/FLAG1fefac6ee [2018-11-10 03:53:33,604 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:53:33,605 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_42b68867-c185-4f37-959e-7801ec18086e/sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-10 03:53:33,611 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_42b68867-c185-4f37-959e-7801ec18086e/bin-2019/uautomizer/data/bdc30aa9d/8aa1e6ca958b4066877a9c23f25a1bb5/FLAG1fefac6ee [2018-11-10 03:53:33,625 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_42b68867-c185-4f37-959e-7801ec18086e/bin-2019/uautomizer/data/bdc30aa9d/8aa1e6ca958b4066877a9c23f25a1bb5 [2018-11-10 03:53:33,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:53:33,628 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:53:33,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:53:33,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:53:33,632 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:53:33,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:53:33" (1/1) ... [2018-11-10 03:53:33,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7828c743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:53:33, skipping insertion in model container [2018-11-10 03:53:33,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:53:33" (1/1) ... [2018-11-10 03:53:33,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:53:33,674 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:53:33,855 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:53:33,862 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:53:33,884 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:53:33,916 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:53:33,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:53:33 WrapperNode [2018-11-10 03:53:33,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:53:33,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:53:33,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:53:33,917 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:53:33,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:53:33" (1/1) ... [2018-11-10 03:53:33,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:53:33" (1/1) ... [2018-11-10 03:53:33,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:53:33,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:53:33,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:53:33,992 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:53:33,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:53:33" (1/1) ... [2018-11-10 03:53:33,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:53:33" (1/1) ... [2018-11-10 03:53:34,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:53:33" (1/1) ... [2018-11-10 03:53:34,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:53:33" (1/1) ... [2018-11-10 03:53:34,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:53:33" (1/1) ... [2018-11-10 03:53:34,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:53:33" (1/1) ... [2018-11-10 03:53:34,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:53:33" (1/1) ... [2018-11-10 03:53:34,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:53:34,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:53:34,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:53:34,011 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:53:34,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:53:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42b68867-c185-4f37-959e-7801ec18086e/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-10 03:53:34,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 03:53:34,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 03:53:34,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:53:34,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:53:34,229 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:53:34,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:53:34 BoogieIcfgContainer [2018-11-10 03:53:34,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:53:34,230 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 03:53:34,230 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 03:53:34,232 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 03:53:34,233 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:53:34,233 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 03:53:33" (1/3) ... [2018-11-10 03:53:34,233 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@370b148a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:53:34, skipping insertion in model container [2018-11-10 03:53:34,233 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:53:34,234 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:53:33" (2/3) ... [2018-11-10 03:53:34,234 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@370b148a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:53:34, skipping insertion in model container [2018-11-10 03:53:34,234 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:53:34,234 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:53:34" (3/3) ... [2018-11-10 03:53:34,235 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-10 03:53:34,271 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:53:34,271 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 03:53:34,271 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 03:53:34,272 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 03:53:34,272 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:53:34,272 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:53:34,272 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 03:53:34,272 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:53:34,272 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 03:53:34,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 03:53:34,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 03:53:34,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:53:34,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:53:34,301 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:53:34,301 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:53:34,301 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 03:53:34,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 03:53:34,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 03:53:34,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:53:34,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:53:34,304 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:53:34,304 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:53:34,309 INFO L793 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 19#L558true assume !(main_~length1~0 < 1); 23#L558-2true assume !(main_~length2~0 < 1); 16#L561-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 6#L566true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 8#L566-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 22#L567true assume { :begin_inline_cstrpbrk } true;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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; 12#L545-5true [2018-11-10 03:53:34,309 INFO L795 eck$LassoCheckResult]: Loop: 12#L545-5true assume true; 24#L545-1true SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L545-1 25#L545-2true assume !!(cstrpbrk_#t~mem3 != 0);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 20#L547true SUMMARY for call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L547 21#L547-1true cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 29#L548-9true assume !true; 30#L548-10true SUMMARY for call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L548-10 14#L550true assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 11#L545-4true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 12#L545-5true [2018-11-10 03:53:34,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:53:34,314 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-11-10 03:53:34,315 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:53:34,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:53:34,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:34,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:53:34,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:34,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:53:34,413 INFO L82 PathProgramCache]: Analyzing trace with hash 63979231, now seen corresponding path program 1 times [2018-11-10 03:53:34,413 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:53:34,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:53:34,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:34,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:53:34,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:53:34,438 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-10 03:53:34,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:53:34,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:53:34,442 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:53:34,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 03:53:34,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 03:53:34,452 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-10 03:53:34,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:53:34,457 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-10 03:53:34,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 03:53:34,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2018-11-10 03:53:34,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 03:53:34,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 23 states and 27 transitions. [2018-11-10 03:53:34,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 03:53:34,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 03:53:34,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-11-10 03:53:34,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:53:34,465 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 03:53:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-11-10 03:53:34,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-10 03:53:34,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 03:53:34,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-10 03:53:34,482 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 03:53:34,482 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 03:53:34,482 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 03:53:34,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-11-10 03:53:34,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 03:53:34,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:53:34,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:53:34,484 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:53:34,484 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:53:34,484 INFO L793 eck$LassoCheckResult]: Stem: 83#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 82#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 64#L558 assume !(main_~length1~0 < 1); 65#L558-2 assume !(main_~length2~0 < 1); 74#L561-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 77#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 78#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 72#L567 assume { :begin_inline_cstrpbrk } true;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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; 73#L545-5 [2018-11-10 03:53:34,484 INFO L795 eck$LassoCheckResult]: Loop: 73#L545-5 assume true; 79#L545-1 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L545-1 80#L545-2 assume !!(cstrpbrk_#t~mem3 != 0);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 66#L547 SUMMARY for call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L547 67#L547-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 70#L548-9 assume true; 68#L548-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L548-1 69#L548-2 cstrpbrk_#t~short7 := cstrpbrk_#t~mem5 != 0; 71#L548-3 assume !cstrpbrk_#t~short7; 76#L548-7 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 84#L548-10 SUMMARY for call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L548-10 86#L550 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 85#L545-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 73#L545-5 [2018-11-10 03:53:34,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:53:34,485 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-11-10 03:53:34,485 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:53:34,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:53:34,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:34,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:53:34,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:34,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:53:34,513 INFO L82 PathProgramCache]: Analyzing trace with hash -446768180, now seen corresponding path program 1 times [2018-11-10 03:53:34,513 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:53:34,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:53:34,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:34,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:53:34,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:53:34,632 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-10 03:53:34,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:53:34,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 03:53:34,633 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:53:34,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 03:53:34,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-10 03:53:34,634 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-11-10 03:53:34,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:53:34,847 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-10 03:53:34,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 03:53:34,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-11-10 03:53:34,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 03:53:34,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 33 transitions. [2018-11-10 03:53:34,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-10 03:53:34,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-10 03:53:34,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2018-11-10 03:53:34,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:53:34,851 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-10 03:53:34,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2018-11-10 03:53:34,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-11-10 03:53:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 03:53:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-10 03:53:34,853 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-10 03:53:34,853 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-10 03:53:34,853 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 03:53:34,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2018-11-10 03:53:34,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 03:53:34,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:53:34,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:53:34,855 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:53:34,855 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:53:34,855 INFO L793 eck$LassoCheckResult]: Stem: 169#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 168#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 149#L558 assume !(main_~length1~0 < 1); 150#L558-2 assume !(main_~length2~0 < 1); 159#L561-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 162#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 163#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 157#L567 assume { :begin_inline_cstrpbrk } true;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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; 158#L545-5 [2018-11-10 03:53:34,855 INFO L795 eck$LassoCheckResult]: Loop: 158#L545-5 assume true; 164#L545-1 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L545-1 165#L545-2 assume !!(cstrpbrk_#t~mem3 != 0);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 151#L547 SUMMARY for call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L547 152#L547-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 155#L548-9 assume true; 153#L548-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L548-1 154#L548-2 cstrpbrk_#t~short7 := cstrpbrk_#t~mem5 != 0; 156#L548-3 assume cstrpbrk_#t~short7; 160#L548-4 SUMMARY for call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L548-4 166#L548-5 cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 167#L548-7 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 172#L548-10 SUMMARY for call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L548-10 171#L550 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 170#L545-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 158#L545-5 [2018-11-10 03:53:34,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:53:34,856 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 3 times [2018-11-10 03:53:34,856 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:53:34,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:53:34,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:34,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:53:34,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:34,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:53:34,877 INFO L82 PathProgramCache]: Analyzing trace with hash 685642345, now seen corresponding path program 1 times [2018-11-10 03:53:34,877 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:53:34,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:53:34,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:34,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:53:34,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:34,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:53:34,894 INFO L82 PathProgramCache]: Analyzing trace with hash -110950913, now seen corresponding path program 1 times [2018-11-10 03:53:34,895 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:53:34,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:53:34,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:34,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:53:34,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:35,055 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-10 03:53:35,202 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-10 03:53:35,373 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2018-11-10 03:53:35,450 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:53:35,451 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:53:35,451 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:53:35,451 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:53:35,451 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:53:35,451 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:53:35,451 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:53:35,451 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:53:35,451 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-10 03:53:35,452 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:53:35,452 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:53:35,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-10 03:53:35,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-10 03:53:35,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-10 03:53:35,473 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-10 03:53:35,474 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-10 03:53:35,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-10 03:53:35,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-10 03:53:35,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-10 03:53:35,481 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-10 03:53:35,483 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-10 03:53:35,484 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-10 03:53:35,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-10 03:53:35,487 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-10 03:53:35,488 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-10 03:53:35,490 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-10 03:53:35,730 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2018-11-10 03:53:35,834 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-10 03:53:35,835 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-10 03:53:35,836 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-10 03:53:35,837 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-10 03:53:35,839 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-10 03:53:36,249 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:53:36,253 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:53:36,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:53:36,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:36,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:36,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:36,259 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:36,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:36,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:36,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:36,261 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:36,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:36,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:36,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:36,263 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:36,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:36,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:36,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:36,265 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:53:36,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:36,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:36,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:36,267 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:53:36,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,270 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:53:36,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:36,272 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:53:36,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:36,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:36,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:36,275 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:36,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:36,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:36,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:36,280 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:36,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:36,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:36,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:36,283 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:36,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:53:36,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:36,287 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:53:36,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:36,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:36,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:36,289 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:53:36,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:36,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:36,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:36,292 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:53:36,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:36,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:36,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:36,297 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:53:36,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:36,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:36,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:36,299 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:53:36,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:53:36,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:36,304 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:53:36,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,305 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:53:36,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,308 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:53:36,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:36,322 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:53:36,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:53:36,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:36,326 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:53:36,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:53:36,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:36,343 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:53:36,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,344 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:53:36,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,348 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:53:36,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:36,359 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:53:36,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:36,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:36,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:36,364 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:36,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:53:36,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:36,375 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:36,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:36,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:36,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:36,380 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:36,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:36,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:36,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:36,382 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:36,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:36,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,383 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:53:36,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,384 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:53:36,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:36,393 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:36,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:53:36,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:36,397 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:36,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:36,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:36,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:36,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:36,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:36,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:53:36,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:36,426 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:53:36,445 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 03:53:36,445 INFO L444 ModelExtractionUtils]: 26 out of 34 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 03:53:36,447 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:53:36,448 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:53:36,448 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:53:36,448 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_cstrpbrk_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_cstrpbrk_~sc1~0.offset Supporting invariants [] [2018-11-10 03:53:36,492 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 03:53:36,499 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 03:53:36,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:53:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:53:36,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:53:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:53:36,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:53:36,604 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-10 03:53:36,606 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-10 03:53:36,606 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-10 03:53:36,644 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 40 states and 47 transitions. Complement of second has 7 states. [2018-11-10 03:53:36,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:53:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 03:53:36,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-10 03:53:36,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 15 letters. [2018-11-10 03:53:36,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:53:36,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 23 letters. Loop has 15 letters. [2018-11-10 03:53:36,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:53:36,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 30 letters. [2018-11-10 03:53:36,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:53:36,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2018-11-10 03:53:36,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 03:53:36,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 37 states and 44 transitions. [2018-11-10 03:53:36,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 03:53:36,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 03:53:36,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 44 transitions. [2018-11-10 03:53:36,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:53:36,649 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-10 03:53:36,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 44 transitions. [2018-11-10 03:53:36,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-10 03:53:36,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 03:53:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-10 03:53:36,651 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-10 03:53:36,651 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-10 03:53:36,651 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 03:53:36,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2018-11-10 03:53:36,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:53:36,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:53:36,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:53:36,652 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:53:36,652 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:53:36,652 INFO L793 eck$LassoCheckResult]: Stem: 380#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 379#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 349#L558 assume !(main_~length1~0 < 1); 350#L558-2 assume !(main_~length2~0 < 1); 365#L561-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 370#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 371#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 363#L567 assume { :begin_inline_cstrpbrk } true;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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; 364#L545-5 assume true; 374#L545-1 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L545-1 375#L545-2 assume !!(cstrpbrk_#t~mem3 != 0);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 351#L547 SUMMARY for call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L547 352#L547-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 359#L548-9 [2018-11-10 03:53:36,652 INFO L795 eck$LassoCheckResult]: Loop: 359#L548-9 assume true; 355#L548-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L548-1 356#L548-2 cstrpbrk_#t~short7 := cstrpbrk_#t~mem5 != 0; 361#L548-3 assume !cstrpbrk_#t~short7; 367#L548-7 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset + 1;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 359#L548-9 [2018-11-10 03:53:36,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:53:36,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 1 times [2018-11-10 03:53:36,652 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:53:36,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:53:36,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:36,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:53:36,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:36,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:53:36,666 INFO L82 PathProgramCache]: Analyzing trace with hash 61138312, now seen corresponding path program 1 times [2018-11-10 03:53:36,666 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:53:36,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:53:36,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:36,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:53:36,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:53:36,678 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-10 03:53:36,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:53:36,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:53:36,679 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:53:36,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:53:36,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:53:36,679 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-10 03:53:36,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:53:36,690 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-10 03:53:36,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:53:36,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2018-11-10 03:53:36,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:53:36,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 40 transitions. [2018-11-10 03:53:36,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 03:53:36,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 03:53:36,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2018-11-10 03:53:36,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:53:36,693 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 03:53:36,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2018-11-10 03:53:36,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-10 03:53:36,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 03:53:36,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-10 03:53:36,695 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 03:53:36,695 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 03:53:36,695 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 03:53:36,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 40 transitions. [2018-11-10 03:53:36,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:53:36,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:53:36,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:53:36,697 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:53:36,697 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:53:36,697 INFO L793 eck$LassoCheckResult]: Stem: 458#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 457#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 428#L558 assume !(main_~length1~0 < 1); 429#L558-2 assume !(main_~length2~0 < 1); 444#L561-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 447#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 448#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 442#L567 assume { :begin_inline_cstrpbrk } true;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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; 443#L545-5 assume true; 449#L545-1 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L545-1 450#L545-2 assume !!(cstrpbrk_#t~mem3 != 0);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 430#L547 SUMMARY for call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L547 431#L547-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 438#L548-9 [2018-11-10 03:53:36,698 INFO L795 eck$LassoCheckResult]: Loop: 438#L548-9 assume true; 434#L548-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L548-1 435#L548-2 cstrpbrk_#t~short7 := cstrpbrk_#t~mem5 != 0; 440#L548-3 assume cstrpbrk_#t~short7; 445#L548-4 SUMMARY for call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L548-4 453#L548-5 cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 455#L548-7 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset + 1;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 438#L548-9 [2018-11-10 03:53:36,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:53:36,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 2 times [2018-11-10 03:53:36,698 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:53:36,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:53:36,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:36,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:53:36,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:36,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:53:36,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 1 times [2018-11-10 03:53:36,718 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:53:36,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:53:36,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:36,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:53:36,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:36,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:53:36,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1160139397, now seen corresponding path program 1 times [2018-11-10 03:53:36,725 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:53:36,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:53:36,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:36,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:53:36,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:37,108 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2018-11-10 03:53:37,218 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-10 03:53:37,219 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:53:37,220 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:53:37,220 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:53:37,220 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:53:37,220 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:53:37,220 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:53:37,220 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:53:37,220 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:53:37,220 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-10 03:53:37,220 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:53:37,220 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:53:37,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:53:37,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:53:37,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:53:37,230 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-10 03:53:37,232 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-10 03:53:37,233 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-10 03:53:37,234 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-10 03:53:37,235 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-10 03:53:37,455 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 97 [2018-11-10 03:53:37,546 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-10 03:53:37,551 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-10 03:53:37,552 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-10 03:53:37,553 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-10 03:53:37,555 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-10 03:53:37,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-10 03:53:37,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-10 03:53:37,557 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-10 03:53:37,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-10 03:53:37,559 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-10 03:53:37,560 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-10 03:53:37,563 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-10 03:53:38,037 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:53:38,037 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:53:38,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:38,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:38,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:38,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:38,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:38,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:38,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:38,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:38,040 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:38,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:38,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:38,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:38,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:38,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:38,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:38,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:38,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:38,045 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:38,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:38,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:38,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:38,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:38,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:38,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:38,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:38,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:38,047 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:38,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:38,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:38,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:38,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:38,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:38,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:38,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:38,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:38,048 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:38,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:38,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:38,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:38,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:38,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:38,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:38,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:38,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:38,050 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:38,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:38,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:38,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:38,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:38,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:38,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:53:38,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:38,053 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:38,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:38,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:38,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:38,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:38,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:38,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:38,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:38,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:38,054 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:38,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:38,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:38,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:38,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:38,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:38,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:53:38,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:38,057 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:38,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:38,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:38,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:38,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:38,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:38,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:53:38,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:38,061 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:38,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:38,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:38,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:38,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:38,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:38,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:53:38,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:38,079 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:53:38,097 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 03:53:38,097 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 03:53:38,098 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:53:38,098 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:53:38,099 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:53:38,099 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 Supporting invariants [] [2018-11-10 03:53:38,150 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-10 03:53:38,153 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 03:53:38,153 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 03:53:38,153 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 03:53:38,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:53:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:53:38,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:53:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:53:38,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:53:38,215 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-10 03:53:38,216 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-10 03:53:38,216 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-11-10 03:53:38,292 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 7. Second operand 7 states. Result 86 states and 94 transitions. Complement of second has 10 states. [2018-11-10 03:53:38,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:53:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 03:53:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-11-10 03:53:38,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-10 03:53:38,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:53:38,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 20 letters. Loop has 7 letters. [2018-11-10 03:53:38,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:53:38,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 13 letters. Loop has 14 letters. [2018-11-10 03:53:38,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:53:38,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 94 transitions. [2018-11-10 03:53:38,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:53:38,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 60 states and 66 transitions. [2018-11-10 03:53:38,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 03:53:38,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 03:53:38,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 66 transitions. [2018-11-10 03:53:38,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:53:38,300 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-11-10 03:53:38,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 66 transitions. [2018-11-10 03:53:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-11-10 03:53:38,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 03:53:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-11-10 03:53:38,306 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-10 03:53:38,306 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-10 03:53:38,306 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 03:53:38,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 57 transitions. [2018-11-10 03:53:38,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:53:38,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:53:38,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:53:38,307 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:53:38,307 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:53:38,307 INFO L793 eck$LassoCheckResult]: Stem: 740#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 739#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 708#L558 assume !(main_~length1~0 < 1); 709#L558-2 assume !(main_~length2~0 < 1); 725#L561-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset; 728#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 729#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 723#L567 assume { :begin_inline_cstrpbrk } true;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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; 724#L545-5 assume true; 745#L545-1 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L545-1 738#L545-2 assume !!(cstrpbrk_#t~mem3 != 0);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 716#L547 SUMMARY for call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L547 717#L547-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 722#L548-9 assume true; 712#L548-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L548-1 713#L548-2 cstrpbrk_#t~short7 := cstrpbrk_#t~mem5 != 0; 756#L548-3 assume cstrpbrk_#t~short7; 754#L548-4 SUMMARY for call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L548-4 752#L548-5 cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 741#L548-7 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 742#L548-10 SUMMARY for call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L548-10 746#L550 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 743#L545-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 744#L545-5 assume true; 732#L545-1 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L545-1 733#L545-2 assume !!(cstrpbrk_#t~mem3 != 0);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 714#L547 SUMMARY for call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L547 715#L547-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 721#L548-9 [2018-11-10 03:53:38,308 INFO L795 eck$LassoCheckResult]: Loop: 721#L548-9 assume true; 710#L548-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L548-1 711#L548-2 cstrpbrk_#t~short7 := cstrpbrk_#t~mem5 != 0; 718#L548-3 assume cstrpbrk_#t~short7; 726#L548-4 SUMMARY for call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L548-4 730#L548-5 cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 736#L548-7 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset + 1;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 721#L548-9 [2018-11-10 03:53:38,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:53:38,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1457731651, now seen corresponding path program 2 times [2018-11-10 03:53:38,308 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:53:38,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:53:38,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:38,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:53:38,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:38,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:53:38,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 2 times [2018-11-10 03:53:38,337 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:53:38,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:53:38,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:38,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:53:38,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:38,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:53:38,345 INFO L82 PathProgramCache]: Analyzing trace with hash 547488335, now seen corresponding path program 1 times [2018-11-10 03:53:38,345 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:53:38,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:53:38,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:38,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:53:38,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:53:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:53:38,899 WARN L179 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 145 [2018-11-10 03:53:39,520 WARN L179 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 116 [2018-11-10 03:53:39,521 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:53:39,521 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:53:39,521 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:53:39,522 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:53:39,522 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:53:39,522 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:53:39,522 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:53:39,522 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:53:39,522 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-10 03:53:39,522 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:53:39,522 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:53:39,528 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-10 03:53:39,533 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-10 03:53:39,537 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-10 03:53:39,538 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-10 03:53:39,540 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-10 03:53:39,542 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-10 03:53:39,543 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-10 03:53:39,544 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-10 03:53:39,552 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-10 03:53:39,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-10 03:53:39,555 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-10 03:53:39,557 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-10 03:53:39,559 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-10 03:53:39,560 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-10 03:53:39,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-10 03:53:39,562 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-10 03:53:39,704 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 03:53:40,244 WARN L179 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 114 [2018-11-10 03:53:40,352 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-10 03:53:40,353 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-10 03:53:40,354 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-10 03:53:40,355 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-10 03:53:40,766 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-11-10 03:53:40,991 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:53:40,991 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:53:40,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:40,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:40,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:40,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:40,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:40,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:40,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:40,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:40,993 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:40,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:40,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:40,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:40,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:40,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:40,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:40,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:40,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:40,994 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:40,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:40,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:40,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:40,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:40,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:40,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:40,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:40,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:40,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:40,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:40,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:40,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:40,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:40,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:40,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:40,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:40,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:40,997 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:40,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:40,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:40,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:40,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:40,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:40,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:53:40,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:40,999 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:40,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:40,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:40,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:40,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:40,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:41,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:41,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:41,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:41,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:41,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:41,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:41,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:41,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:41,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:41,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:41,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:41,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:41,002 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:41,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:53:41,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:41,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:41,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:41,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:41,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:41,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:41,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:41,003 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:41,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:41,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:41,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:41,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:41,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:41,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:53:41,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:41,005 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:41,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:41,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:41,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:41,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:41,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:41,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:41,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:41,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:41,007 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:41,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:53:41,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:41,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:41,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:41,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:41,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:41,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:41,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:41,010 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:41,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:53:41,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:41,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:41,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:41,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:41,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:41,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:41,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:41,012 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:41,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:41,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:41,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:41,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:41,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:41,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:41,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:41,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:41,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:41,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:41,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:41,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:41,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:41,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:41,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:41,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:41,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:41,015 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:41,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:41,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:41,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:53:41,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:41,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:41,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:41,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:53:41,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:53:41,017 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:41,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:41,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:41,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:41,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:41,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:41,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:53:41,019 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:41,020 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:41,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:41,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:41,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:41,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:41,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:41,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:53:41,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:41,024 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:41,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:41,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:41,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:41,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:41,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:41,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:53:41,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:41,028 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:41,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:41,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:41,028 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-10 03:53:41,029 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-10 03:53:41,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:41,052 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2018-11-10 03:53:41,052 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-10 03:53:41,175 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:41,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:41,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:41,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:41,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:41,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:41,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:53:41,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:41,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:41,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:41,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:41,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:41,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:41,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:41,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:53:41,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:41,182 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:41,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:41,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:41,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:41,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:41,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:41,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:53:41,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:41,184 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:41,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:41,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:41,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:41,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:41,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:41,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:53:41,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:41,187 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:41,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:41,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:41,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:41,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:41,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:41,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:53:41,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:41,189 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:41,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:41,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:41,190 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:53:41,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:41,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:41,191 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:53:41,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:41,195 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:53:41,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 03:53:41,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:53:41,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:53:41,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:53:41,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:53:41,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:53:41,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:53:41,213 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:53:41,227 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 03:53:41,227 INFO L444 ModelExtractionUtils]: 52 out of 58 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 03:53:41,227 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:53:41,228 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:53:41,228 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:53:41,228 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3 Supporting invariants [] [2018-11-10 03:53:41,343 INFO L297 tatePredicateManager]: 30 out of 31 supporting invariants were superfluous and have been removed [2018-11-10 03:53:41,345 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 03:53:41,345 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 03:53:41,346 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 03:53:41,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:53:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:53:41,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:53:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:53:41,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:53:41,429 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-10 03:53:41,430 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-10 03:53:41,430 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-10 03:53:41,497 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 80 states and 86 transitions. Complement of second has 10 states. [2018-11-10 03:53:41,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:53:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 03:53:41,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-11-10 03:53:41,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 03:53:41,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:53:41,498 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:53:41,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:53:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:53:41,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:53:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:53:41,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:53:41,582 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-10 03:53:41,582 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-10 03:53:41,582 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-10 03:53:41,667 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 80 states and 86 transitions. Complement of second has 10 states. [2018-11-10 03:53:41,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:53:41,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 03:53:41,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-11-10 03:53:41,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 03:53:41,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:53:41,669 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:53:41,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:53:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:53:41,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:53:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:53:41,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:53:41,730 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-10 03:53:41,731 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-10 03:53:41,731 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-10 03:53:41,776 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 85 states and 92 transitions. Complement of second has 9 states. [2018-11-10 03:53:41,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:53:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 03:53:41,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2018-11-10 03:53:41,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 03:53:41,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:53:41,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 35 letters. Loop has 7 letters. [2018-11-10 03:53:41,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:53:41,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 28 letters. Loop has 14 letters. [2018-11-10 03:53:41,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:53:41,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 92 transitions. [2018-11-10 03:53:41,787 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:53:41,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 0 states and 0 transitions. [2018-11-10 03:53:41,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 03:53:41,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 03:53:41,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 03:53:41,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:53:41,787 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:53:41,787 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:53:41,787 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:53:41,788 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 03:53:41,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:53:41,788 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:53:41,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 03:53:41,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 03:53:41 BoogieIcfgContainer [2018-11-10 03:53:41,792 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 03:53:41,793 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:53:41,793 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:53:41,793 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:53:41,793 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:53:34" (3/4) ... [2018-11-10 03:53:41,796 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 03:53:41,796 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:53:41,796 INFO L168 Benchmark]: Toolchain (without parser) took 8168.55 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.6 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -179.8 MB). Peak memory consumption was 114.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:53:41,797 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-10 03:53:41,797 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.27 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 03:53:41,798 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -197.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:53:41,798 INFO L168 Benchmark]: Boogie Preprocessor took 19.16 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-10 03:53:41,798 INFO L168 Benchmark]: RCFGBuilder took 218.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-10 03:53:41,799 INFO L168 Benchmark]: BuchiAutomizer took 7562.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -40.1 MB). Peak memory consumption was 118.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:53:41,799 INFO L168 Benchmark]: Witness Printer took 3.12 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2018-11-10 03:53:41,802 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 287.27 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -197.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.16 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. * RCFGBuilder took 218.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7562.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -40.1 MB). Peak memory consumption was 118.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.12 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * 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 #Ultimate.alloc_#res - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * sc1 and consists of 5 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 7 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 7 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.5s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 52 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 188 SDtfs, 267 SDslu, 230 SDs, 0 SdLazy, 214 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital379 mio100 ax100 hnf99 lsp91 ukn85 mio100 lsp30 div122 bol100 ite100 ukn100 eq172 hnf82 smp90 dnf610 smp25 tf100 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 147ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 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...