./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_96a5c80d-1788-4a85-935e-f6d1eb6c710e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_96a5c80d-1788-4a85-935e-f6d1eb6c710e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_96a5c80d-1788-4a85-935e-f6d1eb6c710e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_96a5c80d-1788-4a85-935e-f6d1eb6c710e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_96a5c80d-1788-4a85-935e-f6d1eb6c710e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_96a5c80d-1788-4a85-935e-f6d1eb6c710e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c10d45b5c95e322c3a9476f6a89ce233987fcc3d ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 21:56:29,881 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:56:29,882 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:56:29,889 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:56:29,890 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:56:29,890 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:56:29,891 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:56:29,891 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:56:29,892 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:56:29,893 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:56:29,893 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:56:29,893 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:56:29,894 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:56:29,894 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:56:29,895 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:56:29,895 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:56:29,895 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:56:29,896 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:56:29,897 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:56:29,898 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:56:29,899 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:56:29,899 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:56:29,901 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:56:29,901 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:56:29,901 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:56:29,901 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:56:29,902 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:56:29,902 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:56:29,903 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:56:29,903 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:56:29,904 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:56:29,904 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:56:29,904 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:56:29,904 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:56:29,905 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:56:29,906 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:56:29,906 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_96a5c80d-1788-4a85-935e-f6d1eb6c710e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 21:56:29,917 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:56:29,917 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:56:29,918 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 21:56:29,918 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 21:56:29,918 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 21:56:29,919 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 21:56:29,919 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 21:56:29,919 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 21:56:29,919 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 21:56:29,919 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 21:56:29,919 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 21:56:29,920 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:56:29,920 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 21:56:29,920 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 21:56:29,920 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:56:29,920 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 21:56:29,920 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 21:56:29,920 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 21:56:29,921 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 21:56:29,921 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 21:56:29,921 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 21:56:29,921 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 21:56:29,921 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:56:29,921 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:56:29,922 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 21:56:29,922 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:56:29,922 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 21:56:29,922 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 21:56:29,923 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 21:56:29,923 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_96a5c80d-1788-4a85-935e-f6d1eb6c710e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c10d45b5c95e322c3a9476f6a89ce233987fcc3d [2018-12-02 21:56:29,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:56:29,954 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:56:29,957 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:56:29,958 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:56:29,958 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:56:29,959 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_96a5c80d-1788-4a85-935e-f6d1eb6c710e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i [2018-12-02 21:56:30,002 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_96a5c80d-1788-4a85-935e-f6d1eb6c710e/bin-2019/uautomizer/data/0b98f5e6f/0bef6b3199b84eb7a48111b50c784167/FLAG699482e80 [2018-12-02 21:56:30,405 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:56:30,406 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_96a5c80d-1788-4a85-935e-f6d1eb6c710e/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i [2018-12-02 21:56:30,412 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_96a5c80d-1788-4a85-935e-f6d1eb6c710e/bin-2019/uautomizer/data/0b98f5e6f/0bef6b3199b84eb7a48111b50c784167/FLAG699482e80 [2018-12-02 21:56:30,420 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_96a5c80d-1788-4a85-935e-f6d1eb6c710e/bin-2019/uautomizer/data/0b98f5e6f/0bef6b3199b84eb7a48111b50c784167 [2018-12-02 21:56:30,423 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:56:30,424 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 21:56:30,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:56:30,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:56:30,428 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:56:30,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:56:30" (1/1) ... [2018-12-02 21:56:30,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f76134a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:56:30, skipping insertion in model container [2018-12-02 21:56:30,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:56:30" (1/1) ... [2018-12-02 21:56:30,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:56:30,462 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:56:30,624 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:56:30,630 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:56:30,689 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:56:30,715 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:56:30,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:56:30 WrapperNode [2018-12-02 21:56:30,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:56:30,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 21:56:30,716 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 21:56:30,716 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 21:56:30,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:56:30" (1/1) ... [2018-12-02 21:56:30,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:56:30" (1/1) ... [2018-12-02 21:56:30,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 21:56:30,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:56:30,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:56:30,740 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:56:30,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:56:30" (1/1) ... [2018-12-02 21:56:30,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:56:30" (1/1) ... [2018-12-02 21:56:30,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:56:30" (1/1) ... [2018-12-02 21:56:30,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:56:30" (1/1) ... [2018-12-02 21:56:30,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:56:30" (1/1) ... [2018-12-02 21:56:30,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:56:30" (1/1) ... [2018-12-02 21:56:30,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:56:30" (1/1) ... [2018-12-02 21:56:30,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:56:30,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:56:30,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:56:30,754 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:56:30,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:56:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96a5c80d-1788-4a85-935e-f6d1eb6c710e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 21:56:30,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 21:56:30,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 21:56:30,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 21:56:30,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 21:56:30,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:56:30,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:56:30,904 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:56:30,904 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 21:56:30,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:56:30 BoogieIcfgContainer [2018-12-02 21:56:30,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:56:30,905 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 21:56:30,905 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 21:56:30,907 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 21:56:30,907 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 21:56:30,908 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 09:56:30" (1/3) ... [2018-12-02 21:56:30,908 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34a3d48c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 09:56:30, skipping insertion in model container [2018-12-02 21:56:30,908 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 21:56:30,908 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:56:30" (2/3) ... [2018-12-02 21:56:30,908 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34a3d48c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 09:56:30, skipping insertion in model container [2018-12-02 21:56:30,909 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 21:56:30,909 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:56:30" (3/3) ... [2018-12-02 21:56:30,910 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-termination.c.i [2018-12-02 21:56:30,939 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 21:56:30,939 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 21:56:30,939 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 21:56:30,939 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 21:56:30,939 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:56:30,940 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:56:30,940 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 21:56:30,940 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:56:30,940 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 21:56:30,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-02 21:56:30,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 21:56:30,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:56:30,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:56:30,965 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 21:56:30,966 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 21:56:30,966 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 21:56:30,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-02 21:56:30,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 21:56:30,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:56:30,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:56:30,967 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 21:56:30,967 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 21:56:30,972 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 10#L562true assume !(main_~length1~0 < 1); 14#L562-2true assume !(main_~length2~0 < 1); 6#L565-1true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~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_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 16#L553-4true [2018-12-02 21:56:30,972 INFO L796 eck$LassoCheckResult]: Loop: 16#L553-4true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 11#L552-1true assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 13#L553-3true assume !true; 16#L553-4true [2018-12-02 21:56:30,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:56:30,975 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-02 21:56:30,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:56:30,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:56:31,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:31,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:56:31,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:31,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:56:31,059 INFO L82 PathProgramCache]: Analyzing trace with hash 49828, now seen corresponding path program 1 times [2018-12-02 21:56:31,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:56:31,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:56:31,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:31,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:56:31,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:56:31,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:56:31,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-02 21:56:31,083 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 21:56:31,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 21:56:31,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 21:56:31,093 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-12-02 21:56:31,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:56:31,096 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-12-02 21:56:31,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 21:56:31,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-12-02 21:56:31,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 21:56:31,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2018-12-02 21:56:31,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 21:56:31,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 21:56:31,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-12-02 21:56:31,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 21:56:31,102 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-02 21:56:31,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-12-02 21:56:31,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-02 21:56:31,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-02 21:56:31,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-12-02 21:56:31,118 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-02 21:56:31,118 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-02 21:56:31,118 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 21:56:31,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-12-02 21:56:31,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 21:56:31,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:56:31,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:56:31,119 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 21:56:31,119 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 21:56:31,119 INFO L794 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 39#L562 assume !(main_~length1~0 < 1); 45#L562-2 assume !(main_~length2~0 < 1); 40#L565-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~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_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 41#L553-4 [2018-12-02 21:56:31,119 INFO L796 eck$LassoCheckResult]: Loop: 41#L553-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 46#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 47#L553-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 43#L553-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 41#L553-4 [2018-12-02 21:56:31,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:56:31,119 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-12-02 21:56:31,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:56:31,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:56:31,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:31,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:56:31,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:31,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:56:31,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1544297, now seen corresponding path program 1 times [2018-12-02 21:56:31,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:56:31,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:56:31,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:31,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:56:31,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:31,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:56:31,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1298350894, now seen corresponding path program 1 times [2018-12-02 21:56:31,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:56:31,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:56:31,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:31,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:56:31,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:31,413 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-12-02 21:56:31,476 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 21:56:31,477 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 21:56:31,477 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 21:56:31,477 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 21:56:31,477 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 21:56:31,477 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 21:56:31,477 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 21:56:31,477 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 21:56:31,477 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-termination.c.i_Iteration2_Lasso [2018-12-02 21:56:31,478 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 21:56:31,478 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 21:56:31,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:31,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:31,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:31,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:31,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:31,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:31,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:31,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:31,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:31,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:31,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:31,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:31,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:31,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:31,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:31,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:31,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:31,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:31,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:32,031 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 21:56:32,035 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 21:56:32,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-12-02 21:56:32,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:32,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:56:32,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:32,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:32,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:32,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:56:32,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:56:32,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:32,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:32,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:32,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:32,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:32,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:32,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:32,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:32,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:32,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:32,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:32,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:32,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:32,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:32,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:32,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:32,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:32,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:32,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:32,065 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 21:56:32,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:32,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:32,067 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 21:56:32,068 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:32,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:32,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:32,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:32,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:32,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:32,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:32,078 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:32,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:32,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:32,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:32,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:32,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:32,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:32,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:32,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:32,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:32,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:32,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:32,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:32,084 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 21:56:32,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:32,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:32,086 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 21:56:32,086 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:32,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:32,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:32,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:32,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:56:32,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:32,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:32,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:32,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:56:32,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:56:32,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:32,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:32,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:32,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:32,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:32,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:32,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:32,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:32,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:32,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:32,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:32,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:56:32,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:32,100 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 21:56:32,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:32,100 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 21:56:32,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:56:32,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:32,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:32,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:32,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:32,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:32,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:32,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:32,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:32,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:32,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:32,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:32,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:32,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:32,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:32,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:32,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:32,126 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 21:56:32,146 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 21:56:32,146 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 21:56:32,147 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 21:56:32,148 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 21:56:32,149 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 21:56:32,149 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1) = -1*ULTIMATE.start_cstrpbrk_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 Supporting invariants [] [2018-12-02 21:56:32,171 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-02 21:56:32,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 21:56:32,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:56:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:32,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:56:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:32,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:56:32,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:56:32,255 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 21:56:32,256 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-12-02 21:56:32,319 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 16 states and 20 transitions. Complement of second has 4 states. [2018-12-02 21:56:32,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 21:56:32,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 21:56:32,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-12-02 21:56:32,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-02 21:56:32,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:56:32,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-02 21:56:32,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:56:32,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-02 21:56:32,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:56:32,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2018-12-02 21:56:32,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 21:56:32,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 19 transitions. [2018-12-02 21:56:32,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-02 21:56:32,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 21:56:32,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-12-02 21:56:32,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 21:56:32,324 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-02 21:56:32,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-12-02 21:56:32,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-12-02 21:56:32,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-02 21:56:32,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-12-02 21:56:32,325 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-12-02 21:56:32,325 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-12-02 21:56:32,325 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 21:56:32,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-12-02 21:56:32,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 21:56:32,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:56:32,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:56:32,326 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:56:32,326 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 21:56:32,326 INFO L794 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 152#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 153#L562 assume !(main_~length1~0 < 1); 162#L562-2 assume !(main_~length2~0 < 1); 154#L565-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~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_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 155#L553-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 163#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 165#L553-3 [2018-12-02 21:56:32,326 INFO L796 eck$LassoCheckResult]: Loop: 165#L553-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 157#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 158#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 165#L553-3 [2018-12-02 21:56:32,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:56:32,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2018-12-02 21:56:32,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:56:32,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:56:32,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:32,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:56:32,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:32,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:56:32,342 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 1 times [2018-12-02 21:56:32,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:56:32,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:56:32,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:32,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:56:32,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:32,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:56:32,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1594172151, now seen corresponding path program 1 times [2018-12-02 21:56:32,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:56:32,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:56:32,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:32,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:56:32,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:32,580 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2018-12-02 21:56:32,652 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 21:56:32,653 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 21:56:32,653 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 21:56:32,653 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 21:56:32,653 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 21:56:32,653 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 21:56:32,653 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 21:56:32,653 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 21:56:32,653 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-02 21:56:32,653 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 21:56:32,653 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 21:56:32,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:32,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:32,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:32,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:32,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:32,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:32,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:32,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:32,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:32,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:32,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:32,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:32,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:32,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:32,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:32,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:32,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:32,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:32,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:33,097 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 21:56:33,098 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 21:56:33,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:33,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:33,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:56:33,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:33,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:33,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:33,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:56:33,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:56:33,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:33,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:33,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:33,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:56:33,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:33,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:33,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:33,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:56:33,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:56:33,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:33,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:33,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:33,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:56:33,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:33,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:33,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:33,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:56:33,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:56:33,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:33,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:33,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:33,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:33,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:33,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:33,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:33,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:33,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:33,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:33,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:33,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:56:33,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:33,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:33,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:33,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:56:33,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:56:33,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:33,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:33,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:33,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:33,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:33,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:33,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:33,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:33,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:33,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:33,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:33,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:56:33,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:33,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:33,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:33,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:56:33,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:56:33,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:33,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:33,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:33,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:56:33,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:33,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:33,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:33,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:56:33,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:56:33,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:33,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:33,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:33,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:56:33,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:33,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:33,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:33,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:56:33,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:56:33,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:33,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:33,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:33,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:56:33,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:33,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:33,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:33,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:56:33,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:56:33,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:33,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:33,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:33,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:33,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:33,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:33,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:33,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:33,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:33,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:33,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:33,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:56:33,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:33,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:33,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:33,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:56:33,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:56:33,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:33,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:33,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:33,125 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 21:56:33,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:33,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:33,126 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 21:56:33,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:33,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:33,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:33,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:33,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:33,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:33,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:33,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:33,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:33,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:33,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:33,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:33,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:33,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:33,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:33,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:33,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:33,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:33,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:33,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:33,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:33,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:33,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:33,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:33,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:33,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:33,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:33,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:33,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:33,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:33,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:33,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:33,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:33,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:33,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:33,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:33,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:33,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:33,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:33,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:33,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:33,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:33,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:33,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:33,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:33,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:33,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:33,149 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:33,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:33,160 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 21:56:33,168 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 21:56:33,168 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 21:56:33,168 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 21:56:33,169 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 21:56:33,169 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 21:56:33,169 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_2, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_2 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2018-12-02 21:56:33,196 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-12-02 21:56:33,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 21:56:33,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:56:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:33,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:56:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:33,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:56:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:56:33,252 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 21:56:33,252 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-12-02 21:56:33,278 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 31 states and 38 transitions. Complement of second has 6 states. [2018-12-02 21:56:33,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 21:56:33,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 21:56:33,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-02 21:56:33,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-02 21:56:33,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:56:33,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-02 21:56:33,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:56:33,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-02 21:56:33,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:56:33,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2018-12-02 21:56:33,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 21:56:33,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 27 transitions. [2018-12-02 21:56:33,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-02 21:56:33,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-02 21:56:33,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2018-12-02 21:56:33,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 21:56:33,283 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-12-02 21:56:33,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2018-12-02 21:56:33,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-12-02 21:56:33,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-02 21:56:33,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-12-02 21:56:33,284 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-02 21:56:33,284 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-02 21:56:33,284 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 21:56:33,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-12-02 21:56:33,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 21:56:33,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:56:33,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:56:33,285 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:56:33,286 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 21:56:33,286 INFO L794 eck$LassoCheckResult]: Stem: 312#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 308#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 309#L562 assume !(main_~length1~0 < 1); 318#L562-2 assume !(main_~length2~0 < 1); 310#L565-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~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_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 311#L553-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 319#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 320#L553-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 315#L553-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 316#L553-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 322#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 321#L553-3 [2018-12-02 21:56:33,286 INFO L796 eck$LassoCheckResult]: Loop: 321#L553-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 313#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 314#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 321#L553-3 [2018-12-02 21:56:33,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:56:33,286 INFO L82 PathProgramCache]: Analyzing trace with hash -2120273357, now seen corresponding path program 2 times [2018-12-02 21:56:33,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:56:33,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:56:33,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:33,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:56:33,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:33,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:56:33,300 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 2 times [2018-12-02 21:56:33,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:56:33,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:56:33,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:33,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:56:33,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:33,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:56:33,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1020472847, now seen corresponding path program 1 times [2018-12-02 21:56:33,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:56:33,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:56:33,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:33,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:56:33,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:33,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:56:33,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:56:33,339 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96a5c80d-1788-4a85-935e-f6d1eb6c710e/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:56:33,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:56:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:33,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:56:33,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-12-02 21:56:33,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 21:56:33,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:56:33,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-12-02 21:56:33,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-02 21:56:33,405 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:56:33,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:56:33,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:56:33,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-02 21:56:33,440 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2018-12-02 21:56:39,353 WARN L180 SmtUtils]: Spent 2.55 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-02 21:56:41,404 WARN L180 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-02 21:56:41,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-02 21:56:41,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-12-02 21:56:41,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:56:41,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:56:41,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:56:41,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-12-02 21:56:41,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:56:41,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:56:41,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-12-02 21:56:41,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 21:56:41,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=101, Unknown=3, NotChecked=0, Total=132 [2018-12-02 21:56:41,452 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 12 states. [2018-12-02 21:56:43,806 WARN L180 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-12-02 21:56:46,065 WARN L180 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2018-12-02 21:56:46,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:56:46,105 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-12-02 21:56:46,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 21:56:46,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2018-12-02 21:56:46,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 21:56:46,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 28 transitions. [2018-12-02 21:56:46,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-02 21:56:46,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-02 21:56:46,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-12-02 21:56:46,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 21:56:46,106 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-12-02 21:56:46,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-12-02 21:56:46,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-02 21:56:46,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-02 21:56:46,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-12-02 21:56:46,108 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-02 21:56:46,108 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-02 21:56:46,108 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 21:56:46,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-12-02 21:56:46,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 21:56:46,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:56:46,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:56:46,109 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:56:46,109 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 21:56:46,109 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 420#L562 assume !(main_~length1~0 < 1); 428#L562-2 assume !(main_~length2~0 < 1); 421#L565-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~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_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 422#L553-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 429#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 430#L553-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 426#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 427#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 434#L553-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 435#L553-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 432#L553-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 433#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 431#L553-3 [2018-12-02 21:56:46,109 INFO L796 eck$LassoCheckResult]: Loop: 431#L553-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 424#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 425#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 431#L553-3 [2018-12-02 21:56:46,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:56:46,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1095399647, now seen corresponding path program 2 times [2018-12-02 21:56:46,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:56:46,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:56:46,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:46,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:56:46,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:46,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:56:46,129 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 3 times [2018-12-02 21:56:46,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:56:46,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:56:46,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:46,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:56:46,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:46,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:56:46,135 INFO L82 PathProgramCache]: Analyzing trace with hash -110602269, now seen corresponding path program 3 times [2018-12-02 21:56:46,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:56:46,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:56:46,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:46,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:56:46,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:46,658 WARN L180 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 160 [2018-12-02 21:56:46,744 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 21:56:46,744 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 21:56:46,744 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 21:56:46,744 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 21:56:46,744 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 21:56:46,744 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 21:56:46,744 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 21:56:46,744 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 21:56:46,744 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-termination.c.i_Iteration5_Lasso [2018-12-02 21:56:46,744 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 21:56:46,744 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 21:56:46,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:46,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:46,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:46,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:46,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:46,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:46,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:46,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:46,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:46,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:46,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:46,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:46,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:46,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:46,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:46,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:47,017 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2018-12-02 21:56:47,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:47,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:47,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:47,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:56:47,653 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-12-02 21:56:47,714 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 21:56:47,714 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 21:56:47,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:47,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:47,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:56:47,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:47,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:47,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:47,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:56:47,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:56:47,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:47,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:47,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:47,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:56:47,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:47,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:47,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:47,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:56:47,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:56:47,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:47,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:47,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:47,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:56:47,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:47,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:47,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:47,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:56:47,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:56:47,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:47,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:47,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:47,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:56:47,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:47,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:47,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:47,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:56:47,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:56:47,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:47,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:47,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:47,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:47,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:47,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:47,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:47,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:47,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:47,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:47,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:47,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:56:47,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:47,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:47,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:47,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:56:47,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:56:47,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:47,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:47,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:47,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:56:47,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:47,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:47,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:47,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:56:47,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:56:47,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:47,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:47,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:47,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:47,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:47,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:47,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:47,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:47,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:47,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:47,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:47,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:56:47,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:47,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:47,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:47,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:56:47,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:56:47,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:47,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:47,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:47,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:47,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:47,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:47,731 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:47,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:47,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:47,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:47,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:47,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:47,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:47,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:47,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:47,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:47,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:47,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:47,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:47,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:56:47,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:47,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:47,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:47,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:56:47,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:56:47,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:47,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:47,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:47,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:56:47,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:47,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:47,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:47,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:56:47,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:56:47,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:47,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:47,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:47,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:47,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:47,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:47,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:47,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:47,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:47,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:47,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:47,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:56:47,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:47,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:47,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:47,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:56:47,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:56:47,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:47,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:47,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:47,747 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 21:56:47,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:47,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:47,748 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 21:56:47,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:47,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:47,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:47,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:47,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:47,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:47,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:47,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:47,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:47,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:47,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:47,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:47,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:47,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:47,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:47,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:47,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:47,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:47,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:47,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:47,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:47,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:47,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:47,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:47,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:47,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:47,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:47,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:47,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:47,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:47,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:47,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:47,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:47,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:56:47,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:56:47,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:56:47,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:56:47,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:56:47,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:56:47,768 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:56:47,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:56:47,789 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 21:56:47,807 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 21:56:47,807 INFO L444 ModelExtractionUtils]: 43 out of 52 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-02 21:56:47,808 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 21:56:47,809 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 21:56:47,809 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 21:56:47,809 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~s2.base)_1, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s2.base)_1 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2018-12-02 21:56:47,896 INFO L297 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2018-12-02 21:56:47,898 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 21:56:47,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:56:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:47,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:56:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:47,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:56:47,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:56:47,940 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 21:56:47,940 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-02 21:56:47,958 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 28 states and 35 transitions. Complement of second has 5 states. [2018-12-02 21:56:47,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 21:56:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 21:56:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-12-02 21:56:47,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-02 21:56:47,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:56:47,959 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 21:56:47,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:56:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:47,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:56:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:47,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:56:48,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:56:48,002 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 21:56:48,002 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-02 21:56:48,027 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 29 states and 36 transitions. Complement of second has 5 states. [2018-12-02 21:56:48,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 21:56:48,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 21:56:48,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-12-02 21:56:48,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-02 21:56:48,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:56:48,028 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 21:56:48,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:56:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:48,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:56:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:48,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:56:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:56:48,065 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 21:56:48,065 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-02 21:56:48,079 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 24 states and 29 transitions. Complement of second has 4 states. [2018-12-02 21:56:48,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 21:56:48,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 21:56:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-12-02 21:56:48,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-02 21:56:48,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:56:48,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 17 letters. Loop has 3 letters. [2018-12-02 21:56:48,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:56:48,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-02 21:56:48,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:56:48,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2018-12-02 21:56:48,082 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 21:56:48,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2018-12-02 21:56:48,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 21:56:48,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 21:56:48,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 21:56:48,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 21:56:48,082 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 21:56:48,082 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 21:56:48,082 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 21:56:48,082 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 21:56:48,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 21:56:48,082 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 21:56:48,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 21:56:48,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 09:56:48 BoogieIcfgContainer [2018-12-02 21:56:48,087 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 21:56:48,087 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 21:56:48,087 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 21:56:48,087 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 21:56:48,088 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:56:30" (3/4) ... [2018-12-02 21:56:48,090 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 21:56:48,090 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 21:56:48,090 INFO L168 Benchmark]: Toolchain (without parser) took 17667.24 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.6 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -246.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2018-12-02 21:56:48,091 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:56:48,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-02 21:56:48,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.80 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-02 21:56:48,092 INFO L168 Benchmark]: Boogie Preprocessor took 14.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:56:48,092 INFO L168 Benchmark]: RCFGBuilder took 150.56 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: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-12-02 21:56:48,092 INFO L168 Benchmark]: BuchiAutomizer took 17181.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -104.8 MB). Peak memory consumption was 71.9 MB. Max. memory is 11.5 GB. [2018-12-02 21:56:48,093 INFO L168 Benchmark]: Witness Printer took 2.84 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:56:48,095 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 291.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.80 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 150.56 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: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17181.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -104.8 MB). Peak memory consumption was 71.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.84 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * scanp and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s2] + -1 * scanp and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 11.9s. Construction of modules took 0.1s. Büchi inclusion checks took 4.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 89 SDtfs, 82 SDslu, 73 SDs, 0 SdLazy, 118 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital221 mio100 ax108 hnf99 lsp89 ukn80 mio100 lsp43 div100 bol100 ite100 ukn100 eq188 hnf87 smp98 dnf226 smp90 tf100 neg97 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...