./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrpbrk_malloc_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c887e629-d64c-4600-8d8c-a58412d53a5c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c887e629-d64c-4600-8d8c-a58412d53a5c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c887e629-d64c-4600-8d8c-a58412d53a5c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c887e629-d64c-4600-8d8c-a58412d53a5c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrpbrk_malloc_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c887e629-d64c-4600-8d8c-a58412d53a5c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c887e629-d64c-4600-8d8c-a58412d53a5c/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 490e2fc9530e2aed3bf6518ae9d012c90796da95 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 15:47:54,896 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:47:54,897 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:47:54,908 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:47:54,908 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:47:54,909 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:47:54,910 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:47:54,911 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:47:54,913 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:47:54,913 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:47:54,914 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:47:54,914 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:47:54,915 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:47:54,916 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:47:54,917 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:47:54,918 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:47:54,918 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:47:54,920 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:47:54,921 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:47:54,923 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:47:54,924 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:47:54,925 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:47:54,927 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:47:54,927 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:47:54,927 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:47:54,928 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:47:54,929 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:47:54,929 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:47:54,930 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:47:54,931 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:47:54,931 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:47:54,932 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:47:54,932 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:47:54,932 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:47:54,933 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:47:54,933 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:47:54,934 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c887e629-d64c-4600-8d8c-a58412d53a5c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 15:47:54,947 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:47:54,947 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:47:54,948 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:47:54,948 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:47:54,948 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:47:54,949 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 15:47:54,949 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 15:47:54,949 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 15:47:54,949 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 15:47:54,949 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 15:47:54,950 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 15:47:54,950 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:47:54,950 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:47:54,951 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:47:54,952 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:47:54,952 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 15:47:54,952 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 15:47:54,952 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 15:47:54,952 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:47:54,953 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 15:47:54,953 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:47:54,953 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 15:47:54,953 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:47:54,953 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:47:54,953 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 15:47:54,954 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:47:54,954 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:47:54,954 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 15:47:54,955 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 15:47:54,955 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_c887e629-d64c-4600-8d8c-a58412d53a5c/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 490e2fc9530e2aed3bf6518ae9d012c90796da95 [2018-11-23 15:47:54,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:47:54,996 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:47:54,999 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:47:55,000 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:47:55,001 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:47:55,001 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c887e629-d64c-4600-8d8c-a58412d53a5c/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrpbrk_malloc_true-termination.c.i [2018-11-23 15:47:55,047 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c887e629-d64c-4600-8d8c-a58412d53a5c/bin-2019/uautomizer/data/29b233a71/53f59dd57f224afab1f980ee35e35943/FLAG11591283c [2018-11-23 15:47:55,469 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:47:55,470 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c887e629-d64c-4600-8d8c-a58412d53a5c/sv-benchmarks/c/termination-15/cstrpbrk_malloc_true-termination.c.i [2018-11-23 15:47:55,479 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c887e629-d64c-4600-8d8c-a58412d53a5c/bin-2019/uautomizer/data/29b233a71/53f59dd57f224afab1f980ee35e35943/FLAG11591283c [2018-11-23 15:47:55,829 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c887e629-d64c-4600-8d8c-a58412d53a5c/bin-2019/uautomizer/data/29b233a71/53f59dd57f224afab1f980ee35e35943 [2018-11-23 15:47:55,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:47:55,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:47:55,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:47:55,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:47:55,837 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:47:55,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:47:55" (1/1) ... [2018-11-23 15:47:55,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74a3f6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:55, skipping insertion in model container [2018-11-23 15:47:55,841 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:47:55" (1/1) ... [2018-11-23 15:47:55,849 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:47:55,878 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:47:56,130 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:47:56,139 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:47:56,241 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:47:56,285 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:47:56,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:56 WrapperNode [2018-11-23 15:47:56,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:47:56,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:47:56,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:47:56,286 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:47:56,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:56" (1/1) ... [2018-11-23 15:47:56,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:56" (1/1) ... [2018-11-23 15:47:56,321 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:47:56,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:47:56,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:47:56,322 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:47:56,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:56" (1/1) ... [2018-11-23 15:47:56,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:56" (1/1) ... [2018-11-23 15:47:56,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:56" (1/1) ... [2018-11-23 15:47:56,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:56" (1/1) ... [2018-11-23 15:47:56,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:56" (1/1) ... [2018-11-23 15:47:56,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:56" (1/1) ... [2018-11-23 15:47:56,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:56" (1/1) ... [2018-11-23 15:47:56,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:47:56,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:47:56,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:47:56,341 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:47:56,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c887e629-d64c-4600-8d8c-a58412d53a5c/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-23 15:47:56,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:47:56,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:47:56,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:47:56,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:47:56,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:47:56,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:47:56,564 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:47:56,564 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 15:47:56,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:47:56 BoogieIcfgContainer [2018-11-23 15:47:56,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:47:56,565 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 15:47:56,565 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 15:47:56,569 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 15:47:56,570 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:47:56,570 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:47:55" (1/3) ... [2018-11-23 15:47:56,571 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a3b7c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:47:56, skipping insertion in model container [2018-11-23 15:47:56,571 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:47:56,571 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:56" (2/3) ... [2018-11-23 15:47:56,571 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a3b7c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:47:56, skipping insertion in model container [2018-11-23 15:47:56,572 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:47:56,572 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:47:56" (3/3) ... [2018-11-23 15:47:56,573 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_malloc_true-termination.c.i [2018-11-23 15:47:56,618 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:47:56,619 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 15:47:56,619 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 15:47:56,619 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 15:47:56,619 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:47:56,619 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:47:56,620 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 15:47:56,620 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:47:56,620 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 15:47:56,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 15:47:56,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 15:47:56,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:47:56,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:47:56,662 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 15:47:56,662 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 15:47:56,662 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 15:47:56,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 15:47:56,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 15:47:56,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:47:56,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:47:56,664 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 15:47:56,664 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 15:47:56,670 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 10#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(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~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 6#L369-4true [2018-11-23 15:47:56,671 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 8#L374true assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 5#L369-3true cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 6#L369-4true [2018-11-23 15:47:56,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:47:56,675 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-23 15:47:56,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:47:56,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:47:56,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:56,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:47:56,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:56,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:47:56,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-11-23 15:47:56,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:47:56,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:47:56,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:56,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:47:56,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:47:56,822 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-23 15:47:56,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:47:56,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:47:56,828 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 15:47:56,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 15:47:56,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 15:47:56,842 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 15:47:56,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:47:56,847 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-23 15:47:56,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 15:47:56,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-23 15:47:56,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 15:47:56,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-11-23 15:47:56,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 15:47:56,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 15:47:56,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-23 15:47:56,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:47:56,857 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 15:47:56,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-23 15:47:56,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 15:47:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 15:47:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-23 15:47:56,880 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 15:47:56,880 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 15:47:56,880 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 15:47:56,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-23 15:47:56,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 15:47:56,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:47:56,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:47:56,882 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 15:47:56,882 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:47:56,882 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(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~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 47#L369-4 [2018-11-23 15:47:56,883 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 56#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 53#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 54#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210; 44#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 45#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 46#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 47#L369-4 [2018-11-23 15:47:56,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:47:56,883 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-23 15:47:56,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:47:56,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:47:56,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:56,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:47:56,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:56,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:47:56,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-11-23 15:47:56,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:47:56,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:47:56,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:56,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:47:56,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:56,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:47:56,947 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-11-23 15:47:56,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:47:56,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:47:56,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:56,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:47:56,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:57,196 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-23 15:47:57,380 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-23 15:47:57,581 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-11-23 15:47:57,676 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:47:57,677 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:47:57,677 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:47:57,678 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:47:57,678 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:47:57,678 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:47:57,678 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:47:57,678 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:47:57,679 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_malloc_true-termination.c.i_Iteration2_Lasso [2018-11-23 15:47:57,679 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:47:57,679 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:47:57,702 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-23 15:47:57,706 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-23 15:47:57,710 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-23 15:47:57,712 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-23 15:47:57,720 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-23 15:47:57,724 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-23 15:47:57,725 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-23 15:47:57,728 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-23 15:47:57,730 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-23 15:47:57,731 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-23 15:47:57,733 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-23 15:47:57,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:47:57,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:47:57,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:47:57,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:47:57,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:47:57,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:47:57,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:47:57,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:47:57,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:47:57,977 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2018-11-23 15:47:58,107 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-11-23 15:47:58,557 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:47:58,560 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:47:58,562 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-23 15:47:58,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:58,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:58,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:58,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,568 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-23 15:47:58,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:58,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:58,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:58,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,571 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-23 15:47:58,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:58,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:58,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:58,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,573 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-23 15:47:58,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:47:58,576 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:47:58,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,579 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-23 15:47:58,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:58,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:58,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:58,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,581 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-23 15:47:58,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:58,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:58,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:58,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,582 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-23 15:47:58,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:47:58,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:47:58,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,588 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-23 15:47:58,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:58,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:58,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:58,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,591 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-23 15:47:58,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:58,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:58,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:58,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,594 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-23 15:47:58,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:58,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:58,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:58,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,597 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-23 15:47:58,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:58,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:58,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:58,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,600 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-23 15:47:58,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:58,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:58,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:58,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,603 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-23 15:47:58,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:58,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:58,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:58,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,605 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-23 15:47:58,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:58,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:58,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:58,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,608 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-23 15:47:58,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:58,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:58,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:58,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,611 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-23 15:47:58,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:58,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:58,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:58,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:47:58,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:58,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:58,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:58,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,616 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-23 15:47:58,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:58,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:58,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:58,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,619 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-23 15:47:58,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:58,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:58,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:58,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,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-23 15:47:58,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:47:58,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:47:58,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,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-23 15:47:58,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:58,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:58,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:58,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,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-23 15:47:58,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,632 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:47:58,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,636 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:47:58,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:47:58,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,650 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-23 15:47:58,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:58,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,651 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 15:47:58,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,653 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:47:58,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:58,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,662 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-23 15:47:58,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:47:58,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:47:58,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:58,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-23 15:47:58,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:58,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:58,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:58,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:58,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:47:58,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:47:58,706 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:47:58,724 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 15:47:58,724 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 15:47:58,726 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:47:58,728 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:47:58,729 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:47:58,729 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1) = -1*ULTIMATE.start_cstrpbrk_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 Supporting invariants [] [2018-11-23 15:47:58,769 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 15:47:58,776 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 15:47:58,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:47:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:47:58,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:47:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:47:58,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:47:58,861 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-23 15:47:58,864 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-23 15:47:58,864 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 15:47:58,916 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-23 15:47:58,917 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-23 15:47:58,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:47:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-11-23 15:47:58,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-23 15:47:58,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:47:58,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-23 15:47:58,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:47:58,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-23 15:47:58,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:47:58,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-23 15:47:58,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:47:58,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-11-23 15:47:58,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 15:47:58,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 15:47:58,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-23 15:47:58,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:47:58,924 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 15:47:58,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-23 15:47:58,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 15:47:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 15:47:58,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-23 15:47:58,926 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 15:47:58,926 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 15:47:58,926 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 15:47:58,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-23 15:47:58,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:47:58,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:47:58,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:47:58,927 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:47:58,927 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:47:58,927 INFO L794 eck$LassoCheckResult]: Stem: 193#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 186#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 187#L382 assume !(main_~length1~0 < 1); 188#L382-2 assume !(main_~length2~0 < 1); 185#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(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~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 182#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 184#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 194#L372-5 [2018-11-23 15:47:58,927 INFO L796 eck$LassoCheckResult]: Loop: 194#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 189#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 190#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 194#L372-5 [2018-11-23 15:47:58,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:47:58,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-23 15:47:58,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:47:58,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:47:58,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:58,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:47:58,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:58,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:47:58,954 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-11-23 15:47:58,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:47:58,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:47:58,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:58,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:47:58,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:58,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:47:58,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-11-23 15:47:58,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:47:58,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:47:58,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:58,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:47:58,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:59,387 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-11-23 15:47:59,475 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:47:59,475 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:47:59,475 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:47:59,475 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:47:59,475 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:47:59,475 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:47:59,476 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:47:59,476 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:47:59,476 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_malloc_true-termination.c.i_Iteration3_Lasso [2018-11-23 15:47:59,476 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:47:59,476 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:47:59,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:47:59,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:47:59,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:47:59,491 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-23 15:47:59,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:47:59,495 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-23 15:47:59,497 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-23 15:47:59,503 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-23 15:47:59,505 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-23 15:47:59,506 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-23 15:47:59,508 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-23 15:47:59,732 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2018-11-23 15:47:59,799 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-23 15:47:59,800 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-23 15:47:59,801 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-23 15:47:59,802 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-23 15:47:59,803 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-23 15:47:59,805 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-23 15:47:59,806 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-23 15:47:59,807 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-23 15:47:59,809 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-23 15:48:00,257 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-23 15:48:00,287 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:48:00,287 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:48:00,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:48:00,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:48:00,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:48:00,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:48:00,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:48:00,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:48:00,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:48:00,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:48:00,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:48:00,295 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-23 15:48:00,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:48:00,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:48:00,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:48:00,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:48:00,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:48:00,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:48:00,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:48:00,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:48:00,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:48:00,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:48:00,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:48:00,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:48:00,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:48:00,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:48:00,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:48:00,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:48:00,307 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-23 15:48:00,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:48:00,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:48:00,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:48:00,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:48:00,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:48:00,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:48:00,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:48:00,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:48:00,310 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-23 15:48:00,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:48:00,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:48:00,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:48:00,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:48:00,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:48:00,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:48:00,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:48:00,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:48:00,317 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-23 15:48:00,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:48:00,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:48:00,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:48:00,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:48:00,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:48:00,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:48:00,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:48:00,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:48:00,319 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-23 15:48:00,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:48:00,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:48:00,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:48:00,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:48:00,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:48:00,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:48:00,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:48:00,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:48:00,321 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-23 15:48:00,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:48:00,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:48:00,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:48:00,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:48:00,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:48:00,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:48:00,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:48:00,329 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-23 15:48:00,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:48:00,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:48:00,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:48:00,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:48:00,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:48:00,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:48:00,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:48:00,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:48:00,331 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-23 15:48:00,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:48:00,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:48:00,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:48:00,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:48:00,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:48:00,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:48:00,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:48:00,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:48:00,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:48:00,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:48:00,334 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:48:00,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:48:00,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:48:00,337 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:48:00,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:48:00,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:48:00,346 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-23 15:48:00,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:48:00,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:48:00,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:48:00,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:48:00,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:48:00,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:48:00,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:48:00,351 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-23 15:48:00,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:48:00,352 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:48:00,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:48:00,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:48:00,357 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:48:00,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:48:00,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:48:00,366 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-23 15:48:00,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:48:00,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:48:00,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:48:00,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:48:00,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:48:00,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:48:00,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:48:00,370 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-23 15:48:00,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:48:00,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:48:00,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:48:00,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:48:00,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:48:00,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:48:00,405 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:48:00,428 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 15:48:00,429 INFO L444 ModelExtractionUtils]: 34 out of 43 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-23 15:48:00,429 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:48:00,430 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:48:00,430 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:48:00,432 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_2) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_2 Supporting invariants [] [2018-11-23 15:48:00,508 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-23 15:48:00,510 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 15:48:00,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:48:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:48:00,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:48:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:48:00,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:48:00,589 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-23 15:48:00,589 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-23 15:48:00,589 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-23 15:48:00,613 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 5 states. [2018-11-23 15:48:00,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 15:48:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:48:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-23 15:48:00,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 15:48:00,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:48:00,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 15:48:00,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:48:00,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-23 15:48:00,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:48:00,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-23 15:48:00,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:48:00,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-11-23 15:48:00,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 15:48:00,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 15:48:00,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-23 15:48:00,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:48:00,618 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-23 15:48:00,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-23 15:48:00,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-23 15:48:00,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 15:48:00,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-11-23 15:48:00,621 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 15:48:00,621 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 15:48:00,621 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 15:48:00,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-11-23 15:48:00,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:48:00,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:48:00,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:48:00,626 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:48:00,626 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:48:00,627 INFO L794 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 359#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 360#L382 assume !(main_~length1~0 < 1); 361#L382-2 assume !(main_~length2~0 < 1); 358#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(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~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 354#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 355#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 368#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 364#L372-1 assume !cstrpbrk_#t~short210; 365#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210; 350#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 351#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 352#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 353#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 357#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 367#L372-5 [2018-11-23 15:48:00,627 INFO L796 eck$LassoCheckResult]: Loop: 367#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 362#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 363#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 367#L372-5 [2018-11-23 15:48:00,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:48:00,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-11-23 15:48:00,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:48:00,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:48:00,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:48:00,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:48:00,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:48:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:48:00,691 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-23 15:48:00,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:48:00,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 15:48:00,691 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:48:00,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:48:00,692 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-11-23 15:48:00,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:48:00,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:48:00,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:48:00,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:48:00,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:48:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:48:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:48:00,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:48:00,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:48:00,811 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-23 15:48:00,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:48:00,868 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2018-11-23 15:48:00,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 15:48:00,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2018-11-23 15:48:00,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 15:48:00,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2018-11-23 15:48:00,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 15:48:00,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 15:48:00,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-11-23 15:48:00,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:48:00,870 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-23 15:48:00,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-11-23 15:48:00,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-23 15:48:00,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 15:48:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-11-23 15:48:00,872 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 15:48:00,872 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 15:48:00,872 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 15:48:00,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-11-23 15:48:00,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:48:00,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:48:00,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:48:00,873 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:48:00,873 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:48:00,874 INFO L794 eck$LassoCheckResult]: Stem: 434#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 431#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 432#L382 assume !(main_~length1~0 < 1); 433#L382-2 assume !(main_~length2~0 < 1); 430#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(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~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 426#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 427#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 440#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 444#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 443#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210; 422#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 423#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 424#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 425#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 429#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 439#L372-5 [2018-11-23 15:48:00,874 INFO L796 eck$LassoCheckResult]: Loop: 439#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 435#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 436#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 439#L372-5 [2018-11-23 15:48:00,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:48:00,875 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-11-23 15:48:00,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:48:00,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:48:00,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:48:00,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:48:00,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:48:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:48:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:48:00,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:48:00,899 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-11-23 15:48:00,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:48:00,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:48:00,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:48:00,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:48:00,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:48:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:48:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:48:00,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:48:00,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-11-23 15:48:00,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:48:00,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:48:00,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:48:00,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:48:00,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:48:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:48:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:48:01,461 WARN L180 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 129 [2018-11-23 15:48:02,134 WARN L180 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 106 [2018-11-23 15:48:02,136 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:48:02,136 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:48:02,136 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:48:02,136 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:48:02,136 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:48:02,136 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:48:02,136 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:48:02,136 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:48:02,136 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_malloc_true-termination.c.i_Iteration5_Lasso [2018-11-23 15:48:02,136 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:48:02,136 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:48:02,141 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-23 15:48:02,143 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-23 15:48:02,144 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-23 15:48:02,146 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-23 15:48:02,147 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-23 15:48:02,148 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-23 15:48:02,149 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-23 15:48:02,150 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-23 15:48:02,308 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 15:48:02,804 WARN L180 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 93 [2018-11-23 15:48:02,902 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-23 15:48:02,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:48:02,904 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-23 15:48:02,906 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-23 15:48:02,907 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-23 15:48:02,908 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-23 15:48:02,910 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-23 15:48:02,911 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-23 15:48:02,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:48:02,914 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-23 15:48:02,915 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-23 15:48:02,917 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-23 15:48:03,412 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-11-23 15:48:03,544 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-23 15:48:03,639 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:48:03,639 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:48:03,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-23 15:48:03,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:48:03,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:48:03,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:48:03,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:48:03,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:48:03,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:48:03,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:48:03,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:48:03,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:48:03,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:48:03,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:48:03,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:48:03,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:48:03,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:48:03,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:48:03,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:48:03,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:48:03,648 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-23 15:48:03,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:48:03,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:48:03,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:48:03,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:48:03,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:48:03,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:48:03,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:48:03,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:48:03,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-23 15:48:03,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:48:03,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:48:03,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:48:03,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:48:03,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:48:03,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:48:03,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:48:03,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:48:03,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-23 15:48:03,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:48:03,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:48:03,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:48:03,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:48:03,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:48:03,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:48:03,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:48:03,654 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-23 15:48:03,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:48:03,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:48:03,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:48:03,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:48:03,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:48:03,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:48:03,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:48:03,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:48:03,656 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-23 15:48:03,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:48:03,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:48:03,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:48:03,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:48:03,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:48:03,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:48:03,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:48:03,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:48:03,658 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-23 15:48:03,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:48:03,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:48:03,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:48:03,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:48:03,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:48:03,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:48:03,678 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:48:03,698 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 15:48:03,699 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 15:48:03,699 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:48:03,700 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:48:03,700 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:48:03,700 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 Supporting invariants [] [2018-11-23 15:48:03,838 INFO L297 tatePredicateManager]: 30 out of 31 supporting invariants were superfluous and have been removed [2018-11-23 15:48:03,840 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 15:48:03,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:48:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:48:03,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:48:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:48:03,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:48:03,936 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-23 15:48:03,936 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-23 15:48:03,936 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 15:48:03,974 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-11-23 15:48:03,975 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-23 15:48:03,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 15:48:03,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 15:48:03,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 15:48:03,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:48:03,976 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 15:48:04,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:48:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:48:04,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:48:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:48:04,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:48:04,048 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-23 15:48:04,049 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 15:48:04,049 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 15:48:04,100 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-11-23 15:48:04,103 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-23 15:48:04,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 15:48:04,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 15:48:04,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 15:48:04,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:48:04,104 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 15:48:04,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:48:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:48:04,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:48:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:48:04,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:48:04,177 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-23 15:48:04,177 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 15:48:04,178 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 15:48:04,218 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 53 transitions. Complement of second has 5 states. [2018-11-23 15:48:04,219 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-23 15:48:04,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 15:48:04,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 15:48:04,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 15:48:04,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:48:04,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 15:48:04,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:48:04,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-23 15:48:04,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:48:04,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-11-23 15:48:04,223 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:48:04,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-11-23 15:48:04,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 15:48:04,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 15:48:04,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 15:48:04,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:48:04,223 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:48:04,223 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:48:04,223 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:48:04,224 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 15:48:04,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 15:48:04,224 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:48:04,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 15:48:04,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:48:04 BoogieIcfgContainer [2018-11-23 15:48:04,231 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 15:48:04,232 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:48:04,232 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:48:04,232 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:48:04,232 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:47:56" (3/4) ... [2018-11-23 15:48:04,236 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 15:48:04,236 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:48:04,237 INFO L168 Benchmark]: Toolchain (without parser) took 8404.31 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 287.8 MB). Free memory was 955.8 MB in the beginning and 921.7 MB in the end (delta: 34.0 MB). Peak memory consumption was 321.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:48:04,238 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:48:04,238 INFO L168 Benchmark]: CACSL2BoogieTranslator took 451.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 955.8 MB in the beginning and 1.1 GB in the end (delta: -132.1 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-11-23 15:48:04,239 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:48:04,240 INFO L168 Benchmark]: Boogie Preprocessor took 19.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-23 15:48:04,240 INFO L168 Benchmark]: RCFGBuilder took 223.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-11-23 15:48:04,241 INFO L168 Benchmark]: BuchiAutomizer took 7666.35 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 921.7 MB in the end (delta: 144.1 MB). Peak memory consumption was 322.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:48:04,242 INFO L168 Benchmark]: Witness Printer took 4.45 ms. Allocated memory is still 1.3 GB. Free memory is still 921.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:48:04,245 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.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 451.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 955.8 MB in the beginning and 1.1 GB in the end (delta: -132.1 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 223.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7666.35 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 921.7 MB in the end (delta: 144.1 MB). Peak memory consumption was 322.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.45 ms. Allocated memory is still 1.3 GB. Free memory is still 921.7 MB. 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[malloc(length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[malloc(length2 * sizeof(char))] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 6.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 106 SDtfs, 104 SDslu, 67 SDs, 0 SdLazy, 102 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital367 mio100 ax100 hnf99 lsp92 ukn71 mio100 lsp31 div133 bol100 ite100 ukn100 eq162 hnf77 smp87 dnf743 smp23 tf100 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...