./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4c2bf76a-27bd-48e8-be61-19828832f99f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4c2bf76a-27bd-48e8-be61-19828832f99f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4c2bf76a-27bd-48e8-be61-19828832f99f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4c2bf76a-27bd-48e8-be61-19828832f99f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4c2bf76a-27bd-48e8-be61-19828832f99f/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4c2bf76a-27bd-48e8-be61-19828832f99f/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 61682d2c31dd7110d61be8ccb8e4bbb3882eca20 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 21:51:04,799 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:51:04,800 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:51:04,807 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:51:04,808 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:51:04,808 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:51:04,809 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:51:04,810 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:51:04,811 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:51:04,812 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:51:04,812 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:51:04,813 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:51:04,813 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:51:04,814 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:51:04,814 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:51:04,815 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:51:04,815 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:51:04,816 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:51:04,818 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:51:04,819 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:51:04,820 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:51:04,820 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:51:04,822 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:51:04,822 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:51:04,822 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:51:04,823 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:51:04,824 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:51:04,824 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:51:04,824 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:51:04,825 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:51:04,825 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:51:04,825 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:51:04,826 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:51:04,826 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:51:04,826 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:51:04,827 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:51:04,827 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4c2bf76a-27bd-48e8-be61-19828832f99f/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-22 21:51:04,834 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:51:04,834 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:51:04,835 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:51:04,835 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:51:04,836 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 21:51:04,836 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 21:51:04,836 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 21:51:04,836 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 21:51:04,836 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 21:51:04,836 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 21:51:04,836 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 21:51:04,836 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:51:04,837 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:51:04,837 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 21:51:04,837 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:51:04,837 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:51:04,837 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:51:04,837 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 21:51:04,837 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 21:51:04,837 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 21:51:04,838 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:51:04,838 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:51:04,838 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 21:51:04,838 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:51:04,838 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 21:51:04,838 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:51:04,838 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:51:04,838 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 21:51:04,839 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:51:04,839 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 21:51:04,839 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 21:51:04,839 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 21:51:04,840 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_4c2bf76a-27bd-48e8-be61-19828832f99f/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 61682d2c31dd7110d61be8ccb8e4bbb3882eca20 [2018-11-22 21:51:04,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:51:04,869 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:51:04,872 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:51:04,873 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:51:04,873 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:51:04,874 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4c2bf76a-27bd-48e8-be61-19828832f99f/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-22 21:51:04,910 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4c2bf76a-27bd-48e8-be61-19828832f99f/bin-2019/uautomizer/data/1c62072c8/e827370874764c0d92232c04e4f7391f/FLAG3976a8a5f [2018-11-22 21:51:05,329 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:51:05,330 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4c2bf76a-27bd-48e8-be61-19828832f99f/sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-22 21:51:05,336 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4c2bf76a-27bd-48e8-be61-19828832f99f/bin-2019/uautomizer/data/1c62072c8/e827370874764c0d92232c04e4f7391f/FLAG3976a8a5f [2018-11-22 21:51:05,347 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4c2bf76a-27bd-48e8-be61-19828832f99f/bin-2019/uautomizer/data/1c62072c8/e827370874764c0d92232c04e4f7391f [2018-11-22 21:51:05,349 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:51:05,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:51:05,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:51:05,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:51:05,352 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:51:05,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:51:05" (1/1) ... [2018-11-22 21:51:05,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cdcfd30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:05, skipping insertion in model container [2018-11-22 21:51:05,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:51:05" (1/1) ... [2018-11-22 21:51:05,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:51:05,388 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:51:05,570 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:51:05,578 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:51:05,648 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:51:05,670 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:51:05,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:05 WrapperNode [2018-11-22 21:51:05,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:51:05,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:51:05,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:51:05,671 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:51:05,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:05" (1/1) ... [2018-11-22 21:51:05,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:05" (1/1) ... [2018-11-22 21:51:05,701 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:51:05,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:51:05,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:51:05,702 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:51:05,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:05" (1/1) ... [2018-11-22 21:51:05,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:05" (1/1) ... [2018-11-22 21:51:05,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:05" (1/1) ... [2018-11-22 21:51:05,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:05" (1/1) ... [2018-11-22 21:51:05,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:05" (1/1) ... [2018-11-22 21:51:05,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:05" (1/1) ... [2018-11-22 21:51:05,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:05" (1/1) ... [2018-11-22 21:51:05,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:51:05,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:51:05,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:51:05,721 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:51:05,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c2bf76a-27bd-48e8-be61-19828832f99f/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:51:05,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 21:51:05,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 21:51:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 21:51:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 21:51:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:51:05,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:51:05,983 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:51:05,983 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-22 21:51:05,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:51:05 BoogieIcfgContainer [2018-11-22 21:51:05,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:51:05,984 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 21:51:05,984 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 21:51:05,987 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 21:51:05,988 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:51:05,988 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 09:51:05" (1/3) ... [2018-11-22 21:51:05,989 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@262882e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 09:51:05, skipping insertion in model container [2018-11-22 21:51:05,990 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:51:05,990 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:51:05" (2/3) ... [2018-11-22 21:51:05,990 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@262882e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 09:51:05, skipping insertion in model container [2018-11-22 21:51:05,990 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:51:05,990 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:51:05" (3/3) ... [2018-11-22 21:51:05,992 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-22 21:51:06,040 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:51:06,041 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 21:51:06,041 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 21:51:06,041 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 21:51:06,041 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:51:06,041 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:51:06,041 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 21:51:06,042 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:51:06,042 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 21:51:06,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-22 21:51:06,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-22 21:51:06,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:51:06,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:51:06,081 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 21:51:06,081 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-22 21:51:06,082 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 21:51:06,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-22 21:51:06,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-22 21:51:06,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:51:06,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:51:06,084 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 21:51:06,084 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-22 21:51:06,091 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 4#L558true assume !(main_~length1~0 < 1); 6#L558-2true assume !(main_~length2~0 < 1); 19#L561-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 15#L545-4true [2018-11-22 21:51:06,091 INFO L796 eck$LassoCheckResult]: Loop: 15#L545-4true call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 8#L545-1true assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 9#L548-5true assume !true; 12#L548-6true call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 18#L550true assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 13#L545-3true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 15#L545-4true [2018-11-22 21:51:06,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:51:06,096 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-22 21:51:06,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:51:06,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:51:06,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:06,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:51:06,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:51:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:51:06,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:51:06,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-11-22 21:51:06,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:51:06,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:51:06,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:06,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:51:06,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:51:06,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:51:06,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:51:06,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 21:51:06,231 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 21:51:06,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 21:51:06,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 21:51:06,241 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-22 21:51:06,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:51:06,245 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-22 21:51:06,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 21:51:06,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-22 21:51:06,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-22 21:51:06,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-11-22 21:51:06,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-22 21:51:06,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-22 21:51:06,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-22 21:51:06,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 21:51:06,253 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-22 21:51:06,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-22 21:51:06,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-22 21:51:06,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-22 21:51:06,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-22 21:51:06,273 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-22 21:51:06,273 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-22 21:51:06,274 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 21:51:06,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-22 21:51:06,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-22 21:51:06,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:51:06,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:51:06,275 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 21:51:06,275 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:51:06,275 INFO L794 eck$LassoCheckResult]: Stem: 56#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 52#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 44#L558 assume !(main_~length1~0 < 1); 45#L558-2 assume !(main_~length2~0 < 1); 48#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 55#L545-4 [2018-11-22 21:51:06,275 INFO L796 eck$LassoCheckResult]: Loop: 55#L545-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 51#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 50#L548-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 46#L548-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 47#L548-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 49#L548-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 53#L550 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 54#L545-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 55#L545-4 [2018-11-22 21:51:06,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:51:06,276 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-22 21:51:06,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:51:06,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:51:06,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:06,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:51:06,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:51:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:51:06,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:51:06,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-11-22 21:51:06,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:51:06,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:51:06,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:06,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:51:06,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:51:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:51:06,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:51:06,326 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-11-22 21:51:06,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:51:06,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:51:06,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:06,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:51:06,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:51:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:51:06,535 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-22 21:51:06,730 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-22 21:51:06,881 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-11-22 21:51:06,961 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:51:06,961 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:51:06,961 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:51:06,962 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:51:06,962 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:51:06,962 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:51:06,962 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:51:06,962 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:51:06,962 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-22 21:51:06,962 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:51:06,962 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:51:06,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:06,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:06,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:06,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:06,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:06,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:06,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:06,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:06,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:06,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:06,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:07,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:07,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:07,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:07,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:07,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:07,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:07,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:07,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:07,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:07,613 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:51:07,617 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:51:07,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:07,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:07,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:07,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:07,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:07,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:07,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:07,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:07,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:07,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:07,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:07,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:07,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:07,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:07,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:07,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:07,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:07,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:07,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:07,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:07,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:07,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:07,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:07,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:07,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:07,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:07,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:07,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:51:07,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:07,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:07,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:07,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:07,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:07,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:07,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:07,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:07,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:07,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:07,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:07,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:07,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:07,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:07,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:07,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:07,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:07,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:07,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:51:07,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:07,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:07,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:07,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:07,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:07,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:07,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:07,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:07,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:07,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:07,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:07,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:07,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:07,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:07,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:07,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:07,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:07,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:07,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:51:07,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:07,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:07,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:07,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:51:07,669 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:07,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:07,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:07,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:07,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:07,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:07,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:07,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:07,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:07,678 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 21:51:07,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,679 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 21:51:07,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:07,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:07,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:07,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,691 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:51:07,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:07,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:07,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:07,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:51:07,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:07,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:07,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,702 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:51:07,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,704 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:51:07,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:07,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:07,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:07,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:51:07,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:07,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,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-11-22 21:51:07,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,718 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:51:07,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,720 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:51:07,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:07,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:07,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:07,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:51:07,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:07,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,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-11-22 21:51:07,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:07,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:51:07,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:07,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:07,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:07,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:07,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:07,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:07,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:07,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:51:07,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:07,767 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:51:07,777 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 21:51:07,777 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 21:51:07,780 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:51:07,781 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 21:51:07,781 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:51:07,781 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1) = -1*ULTIMATE.start_cstrpbrk_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 Supporting invariants [] [2018-11-22 21:51:07,823 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-22 21:51:07,828 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 21:51:07,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:51:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:51:07,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:51:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:51:07,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:51:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:51:07,900 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 21:51:07,900 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-22 21:51:07,949 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2018-11-22 21:51:07,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 21:51:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 21:51:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-11-22 21:51:07,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-22 21:51:07,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:51:07,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-22 21:51:07,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:51:07,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-22 21:51:07,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:51:07,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-22 21:51:07,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 21:51:07,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-11-22 21:51:07,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-22 21:51:07,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-22 21:51:07,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-22 21:51:07,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:51:07,955 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-22 21:51:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-22 21:51:07,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-22 21:51:07,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-22 21:51:07,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-22 21:51:07,957 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-22 21:51:07,957 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-22 21:51:07,957 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 21:51:07,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-22 21:51:07,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 21:51:07,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:51:07,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:51:07,961 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:51:07,962 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 21:51:07,962 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 178#L558 assume !(main_~length1~0 < 1); 179#L558-2 assume !(main_~length2~0 < 1); 184#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 195#L545-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 188#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 185#L548-5 [2018-11-22 21:51:07,962 INFO L796 eck$LassoCheckResult]: Loop: 185#L548-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 180#L548-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 181#L548-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 185#L548-5 [2018-11-22 21:51:07,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:51:07,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-22 21:51:07,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:51:07,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:51:07,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:07,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:51:07,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:51:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:51:07,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:51:07,981 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-11-22 21:51:07,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:51:07,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:51:07,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:07,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:51:07,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:51:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:51:07,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:51:07,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-11-22 21:51:07,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:51:07,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:51:07,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:07,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:51:07,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:51:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:51:08,300 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-11-22 21:51:08,369 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:51:08,369 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:51:08,369 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:51:08,369 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:51:08,369 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:51:08,369 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:51:08,369 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:51:08,369 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:51:08,369 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-22 21:51:08,369 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:51:08,369 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:51:08,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:08,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:08,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:08,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:08,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:08,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:08,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:08,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:08,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:08,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:08,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:08,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:08,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:08,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:08,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:08,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:08,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:08,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:08,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:08,588 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2018-11-22 21:51:08,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:08,986 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:51:08,986 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:51:08,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:08,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:08,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:08,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:08,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:08,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:08,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:08,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:08,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:08,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:08,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:08,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:08,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:08,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:08,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:08,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:08,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:08,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:08,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:08,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:08,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:08,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:08,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:08,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:08,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:08,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:08,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:08,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:08,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:08,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:08,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:08,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:08,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:08,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:08,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:08,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:08,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:08,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:08,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:08,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:08,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:08,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:08,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:08,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:09,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:09,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:09,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:09,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:09,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:09,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:09,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:09,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:09,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:09,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:09,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:09,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:09,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:09,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:09,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:09,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:51:09,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:09,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:09,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:09,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:09,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:09,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:09,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:09,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:09,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:09,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:09,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:09,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:09,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:09,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:09,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:09,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:09,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:09,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:09,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:09,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:09,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:09,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:09,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:09,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:09,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:09,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:09,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:09,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:09,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:09,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:09,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:09,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:09,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:09,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:09,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:51:09,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:09,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:09,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:09,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:09,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:09,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:09,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:09,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:09,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:09,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:09,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:09,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:09,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:09,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:09,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:09,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:09,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:09,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:09,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:09,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:09,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:09,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:09,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:09,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:09,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:09,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:09,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:09,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:09,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:09,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:09,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:09,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:09,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:09,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:09,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:09,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:09,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:09,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:09,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:09,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:09,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:09,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:09,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:09,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:09,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:09,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:09,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:09,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:09,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:09,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:09,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:09,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:09,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:09,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:09,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:09,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:09,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:09,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:09,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:09,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:09,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:09,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:09,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:09,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:09,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:09,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:09,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:09,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:09,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:09,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:09,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:51:09,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:09,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:09,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:09,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:09,032 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:51:09,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:09,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:09,033 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:51:09,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:09,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:09,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-11-22 21:51:09,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:09,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:09,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:09,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:09,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:51:09,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:09,059 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:51:09,073 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-22 21:51:09,073 INFO L444 ModelExtractionUtils]: 37 out of 43 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-22 21:51:09,074 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:51:09,075 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 21:51:09,075 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:51:09,075 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 Supporting invariants [] [2018-11-22 21:51:09,113 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-22 21:51:09,115 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 21:51:09,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:51:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:51:09,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:51:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:51:09,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:51:09,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:51:09,181 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-22 21:51:09,181 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-22 21:51:09,226 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2018-11-22 21:51:09,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 21:51:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 21:51:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-22 21:51:09,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-22 21:51:09,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:51:09,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-22 21:51:09,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:51:09,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-22 21:51:09,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:51:09,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-22 21:51:09,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 21:51:09,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-11-22 21:51:09,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-22 21:51:09,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-22 21:51:09,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-22 21:51:09,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:51:09,231 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-22 21:51:09,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-22 21:51:09,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-22 21:51:09,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-22 21:51:09,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-11-22 21:51:09,233 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-22 21:51:09,233 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-22 21:51:09,233 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 21:51:09,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-11-22 21:51:09,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 21:51:09,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:51:09,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:51:09,238 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:51:09,238 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 21:51:09,238 INFO L794 eck$LassoCheckResult]: Stem: 367#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 363#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 350#L558 assume !(main_~length1~0 < 1); 351#L558-2 assume !(main_~length2~0 < 1); 356#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 368#L545-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 369#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 371#L548-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 372#L548-1 assume !cstrpbrk_#t~short7; 358#L548-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 359#L548-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 364#L550 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 365#L545-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 366#L545-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 360#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 357#L548-5 [2018-11-22 21:51:09,238 INFO L796 eck$LassoCheckResult]: Loop: 357#L548-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 352#L548-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 353#L548-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 357#L548-5 [2018-11-22 21:51:09,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:51:09,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-11-22 21:51:09,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:51:09,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:51:09,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:09,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:51:09,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:51:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:51:09,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:51:09,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-22 21:51:09,293 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 21:51:09,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:51:09,293 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-11-22 21:51:09,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:51:09,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:51:09,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:09,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:51:09,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:51:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:51:09,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 21:51:09,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-22 21:51:09,430 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-22 21:51:09,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:51:09,476 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2018-11-22 21:51:09,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 21:51:09,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2018-11-22 21:51:09,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 21:51:09,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2018-11-22 21:51:09,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-22 21:51:09,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-22 21:51:09,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-11-22 21:51:09,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:51:09,478 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-22 21:51:09,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-11-22 21:51:09,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-22 21:51:09,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-22 21:51:09,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-11-22 21:51:09,480 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-22 21:51:09,481 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-22 21:51:09,481 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-22 21:51:09,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-11-22 21:51:09,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 21:51:09,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:51:09,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:51:09,482 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:51:09,482 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 21:51:09,482 INFO L794 eck$LassoCheckResult]: Stem: 441#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 436#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 422#L558 assume !(main_~length1~0 < 1); 423#L558-2 assume !(main_~length2~0 < 1); 428#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 442#L545-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 443#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 434#L548-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 435#L548-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 444#L548-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 437#L548-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 438#L550 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 439#L545-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 440#L545-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 432#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 429#L548-5 [2018-11-22 21:51:09,482 INFO L796 eck$LassoCheckResult]: Loop: 429#L548-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 424#L548-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 425#L548-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 429#L548-5 [2018-11-22 21:51:09,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:51:09,483 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-11-22 21:51:09,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:51:09,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:51:09,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:09,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:51:09,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:51:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:51:09,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:51:09,501 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-11-22 21:51:09,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:51:09,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:51:09,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:09,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:51:09,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:51:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:51:09,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:51:09,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-11-22 21:51:09,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:51:09,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:51:09,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:09,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:51:09,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:51:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:51:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:51:09,983 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 130 [2018-11-22 21:51:10,527 WARN L180 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 107 [2018-11-22 21:51:10,529 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:51:10,529 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:51:10,529 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:51:10,529 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:51:10,529 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:51:10,529 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:51:10,529 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:51:10,529 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:51:10,529 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-22 21:51:10,529 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:51:10,529 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:51:10,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:10,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:10,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:10,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:10,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:10,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:10,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:10,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:10,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:10,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:10,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:10,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:10,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:10,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:10,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:10,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:10,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:10,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:10,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:10,701 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-22 21:51:11,121 WARN L180 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2018-11-22 21:51:11,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:51:11,597 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-11-22 21:51:11,807 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:51:11,807 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:51:11,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:11,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:11,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:11,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:11,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:11,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:11,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:11,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:11,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:11,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:11,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:11,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:11,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:11,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:11,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:11,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,816 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:51:11,816 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:11,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:11,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:11,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:11,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:11,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:11,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:11,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:51:11,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:11,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:11,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:11,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:11,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:11,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:11,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:11,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:11,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:11,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:11,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:11,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:11,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:11,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:11,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:11,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:11,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:11,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:11,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:11,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:11,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:11,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:11,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:11,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:11,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:11,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:51:11,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:51:11,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:51:11,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:51:11,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:11,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:51:11,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:11,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,846 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-22 21:51:11,846 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-22 21:51:11,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,899 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2018-11-22 21:51:11,899 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-22 21:51:11,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:51:11,969 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:11,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,972 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:51:11,972 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:11,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:51:11,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:11,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:51:11,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:11,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,978 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:51:11,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,979 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:51:11,979 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:11,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,984 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:51:11,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,985 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:51:11,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:11,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:51:11,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:51:11,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:51:11,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:51:11,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:51:11,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:51:11,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:51:11,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:51:12,009 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:51:12,020 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-22 21:51:12,020 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-22 21:51:12,021 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:51:12,021 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 21:51:12,021 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:51:12,021 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_3, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_3 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2018-11-22 21:51:12,150 INFO L297 tatePredicateManager]: 33 out of 33 supporting invariants were superfluous and have been removed [2018-11-22 21:51:12,151 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 21:51:12,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:51:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:51:12,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:51:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:51:12,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:51:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:51:12,205 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 21:51:12,205 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-22 21:51:12,227 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2018-11-22 21:51:12,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 21:51:12,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 21:51:12,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-22 21:51:12,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-22 21:51:12,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:51:12,231 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 21:51:12,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:51:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:51:12,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:51:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:51:12,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:51:12,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:51:12,281 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-11-22 21:51:12,281 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-22 21:51:12,295 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2018-11-22 21:51:12,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 21:51:12,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 21:51:12,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-22 21:51:12,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-22 21:51:12,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:51:12,296 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 21:51:12,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:51:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:51:12,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:51:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:51:12,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:51:12,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:51:12,327 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-11-22 21:51:12,327 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-22 21:51:12,339 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 53 transitions. Complement of second has 4 states. [2018-11-22 21:51:12,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 21:51:12,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 21:51:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-11-22 21:51:12,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-22 21:51:12,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:51:12,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-22 21:51:12,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:51:12,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-22 21:51:12,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:51:12,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-11-22 21:51:12,343 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 21:51:12,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-11-22 21:51:12,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-22 21:51:12,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-22 21:51:12,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-22 21:51:12,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 21:51:12,343 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:51:12,343 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:51:12,343 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:51:12,343 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-22 21:51:12,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-22 21:51:12,343 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 21:51:12,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-22 21:51:12,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 09:51:12 BoogieIcfgContainer [2018-11-22 21:51:12,347 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 21:51:12,347 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:51:12,347 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:51:12,348 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:51:12,348 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:51:05" (3/4) ... [2018-11-22 21:51:12,350 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 21:51:12,350 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:51:12,351 INFO L168 Benchmark]: Toolchain (without parser) took 7001.44 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 234.9 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 77.4 MB. Max. memory is 11.5 GB. [2018-11-22 21:51:12,351 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:51:12,351 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -171.8 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-22 21:51:12,352 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:51:12,352 INFO L168 Benchmark]: Boogie Preprocessor took 19.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-11-22 21:51:12,352 INFO L168 Benchmark]: RCFGBuilder took 262.60 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-22 21:51:12,352 INFO L168 Benchmark]: BuchiAutomizer took 6363.37 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 95.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -9.1 MB). Peak memory consumption was 86.3 MB. Max. memory is 11.5 GB. [2018-11-22 21:51:12,353 INFO L168 Benchmark]: Witness Printer took 2.90 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:51:12,355 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 320.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -171.8 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.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 262.60 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6363.37 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 95.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -9.1 MB). Peak memory consumption was 86.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.90 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 108 SDtfs, 104 SDslu, 57 SDs, 0 SdLazy, 98 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital366 mio100 ax100 hnf99 lsp92 ukn71 mio100 lsp31 div136 bol100 ite100 ukn100 eq161 hnf77 smp92 dnf701 smp23 tf100 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 119ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...