./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrspn_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_1bbd389e-04a6-47b5-8856-b3f0cd9859b6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1bbd389e-04a6-47b5-8856-b3f0cd9859b6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1bbd389e-04a6-47b5-8856-b3f0cd9859b6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1bbd389e-04a6-47b5-8856-b3f0cd9859b6/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrspn_malloc_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1bbd389e-04a6-47b5-8856-b3f0cd9859b6/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1bbd389e-04a6-47b5-8856-b3f0cd9859b6/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 9c357a0f089ccce134e4135f49c3923f49db9d7a ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 01:23:33,050 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:23:33,051 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:23:33,060 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:23:33,060 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:23:33,061 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:23:33,061 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:23:33,062 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:23:33,064 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:23:33,064 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:23:33,065 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:23:33,065 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:23:33,065 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:23:33,066 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:23:33,067 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:23:33,067 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:23:33,068 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:23:33,069 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:23:33,070 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:23:33,071 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:23:33,072 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:23:33,073 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:23:33,074 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:23:33,074 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:23:33,074 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:23:33,075 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:23:33,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:23:33,076 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:23:33,077 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:23:33,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:23:33,077 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:23:33,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:23:33,078 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:23:33,078 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:23:33,079 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:23:33,079 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:23:33,079 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1bbd389e-04a6-47b5-8856-b3f0cd9859b6/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 01:23:33,089 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:23:33,089 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:23:33,090 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:23:33,090 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:23:33,090 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 01:23:33,090 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 01:23:33,091 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 01:23:33,091 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 01:23:33,091 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 01:23:33,091 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 01:23:33,091 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 01:23:33,091 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:23:33,091 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 01:23:33,091 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:23:33,092 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:23:33,092 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 01:23:33,092 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 01:23:33,092 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 01:23:33,092 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:23:33,092 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 01:23:33,092 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:23:33,092 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 01:23:33,093 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:23:33,093 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:23:33,093 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 01:23:33,093 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:23:33,093 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 01:23:33,093 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 01:23:33,094 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 01:23:33,094 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_1bbd389e-04a6-47b5-8856-b3f0cd9859b6/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 -> 9c357a0f089ccce134e4135f49c3923f49db9d7a [2018-11-23 01:23:33,115 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:23:33,125 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:23:33,128 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:23:33,129 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:23:33,129 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:23:33,130 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1bbd389e-04a6-47b5-8856-b3f0cd9859b6/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrspn_malloc_true-termination.c.i [2018-11-23 01:23:33,177 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1bbd389e-04a6-47b5-8856-b3f0cd9859b6/bin-2019/uautomizer/data/47d43d844/a67d5b78aea241bb9cceda1a5c75cc29/FLAGd559ef14b [2018-11-23 01:23:33,565 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:23:33,565 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1bbd389e-04a6-47b5-8856-b3f0cd9859b6/sv-benchmarks/c/termination-15/cstrspn_malloc_true-termination.c.i [2018-11-23 01:23:33,572 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1bbd389e-04a6-47b5-8856-b3f0cd9859b6/bin-2019/uautomizer/data/47d43d844/a67d5b78aea241bb9cceda1a5c75cc29/FLAGd559ef14b [2018-11-23 01:23:33,581 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1bbd389e-04a6-47b5-8856-b3f0cd9859b6/bin-2019/uautomizer/data/47d43d844/a67d5b78aea241bb9cceda1a5c75cc29 [2018-11-23 01:23:33,583 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:23:33,585 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:23:33,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:23:33,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:23:33,588 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:23:33,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:23:33" (1/1) ... [2018-11-23 01:23:33,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dccc58b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:23:33, skipping insertion in model container [2018-11-23 01:23:33,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:23:33" (1/1) ... [2018-11-23 01:23:33,596 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:23:33,621 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:23:33,829 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:23:33,837 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:23:33,919 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:23:33,960 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:23:33,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:23:33 WrapperNode [2018-11-23 01:23:33,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:23:33,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:23:33,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:23:33,961 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:23:33,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:23:33" (1/1) ... [2018-11-23 01:23:33,976 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:23:33" (1/1) ... [2018-11-23 01:23:33,995 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:23:33,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:23:33,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:23:33,995 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:23:34,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:23:33" (1/1) ... [2018-11-23 01:23:34,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:23:33" (1/1) ... [2018-11-23 01:23:34,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:23:33" (1/1) ... [2018-11-23 01:23:34,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:23:33" (1/1) ... [2018-11-23 01:23:34,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:23:33" (1/1) ... [2018-11-23 01:23:34,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:23:33" (1/1) ... [2018-11-23 01:23:34,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:23:33" (1/1) ... [2018-11-23 01:23:34,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:23:34,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:23:34,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:23:34,017 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:23:34,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:23:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1bbd389e-04a6-47b5-8856-b3f0cd9859b6/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 01:23:34,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:23:34,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 01:23:34,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 01:23:34,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:23:34,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:23:34,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:23:34,272 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:23:34,272 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 01:23:34,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:23:34 BoogieIcfgContainer [2018-11-23 01:23:34,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:23:34,273 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 01:23:34,273 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 01:23:34,276 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 01:23:34,276 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 01:23:34,276 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:23:33" (1/3) ... [2018-11-23 01:23:34,277 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5db55e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:23:34, skipping insertion in model container [2018-11-23 01:23:34,277 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 01:23:34,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:23:33" (2/3) ... [2018-11-23 01:23:34,278 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5db55e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:23:34, skipping insertion in model container [2018-11-23 01:23:34,278 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 01:23:34,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:23:34" (3/3) ... [2018-11-23 01:23:34,279 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn_malloc_true-termination.c.i [2018-11-23 01:23:34,316 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 01:23:34,316 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 01:23:34,316 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 01:23:34,316 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 01:23:34,316 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:23:34,316 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:23:34,316 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 01:23:34,317 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:23:34,317 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 01:23:34,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 01:23:34,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 01:23:34,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:23:34,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:23:34,349 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 01:23:34,349 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 01:23:34,349 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 01:23:34,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 01:23:34,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 01:23:34,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:23:34,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:23:34,351 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 01:23:34,351 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 01:23:34,358 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, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 6#L369-4true [2018-11-23 01:23:34,359 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 8#L374true assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 5#L369-3true cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 6#L369-4true [2018-11-23 01:23:34,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:23:34,365 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-23 01:23:34,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:23:34,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:23:34,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:34,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:23:34,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:23:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:23:34,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:23:34,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-11-23 01:23:34,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:23:34,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:23:34,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:34,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:23:34,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:23:34,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:23:34,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:23:34,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:23:34,479 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 01:23:34,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 01:23:34,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 01:23:34,490 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 01:23:34,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:23:34,495 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-23 01:23:34,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 01:23:34,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-23 01:23:34,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 01:23:34,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-11-23 01:23:34,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 01:23:34,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 01:23:34,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-23 01:23:34,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 01:23:34,502 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 01:23:34,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-23 01:23:34,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 01:23:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 01:23:34,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-23 01:23:34,519 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 01:23:34,519 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 01:23:34,519 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 01:23:34,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-23 01:23:34,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 01:23:34,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:23:34,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:23:34,520 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 01:23:34,520 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:23:34,521 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, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 47#L369-4 [2018-11-23 01:23:34,521 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 56#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 53#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208; 44#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 45#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 46#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 47#L369-4 [2018-11-23 01:23:34,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:23:34,521 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-23 01:23:34,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:23:34,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:23:34,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:34,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:23:34,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:23:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:23:34,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:23:34,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-11-23 01:23:34,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:23:34,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:23:34,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:34,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:23:34,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:23:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:23:34,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:23:34,565 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-11-23 01:23:34,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:23:34,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:23:34,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:34,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:23:34,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:23:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:23:34,780 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-23 01:23:34,940 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-23 01:23:35,085 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-11-23 01:23:35,166 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 01:23:35,167 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 01:23:35,167 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 01:23:35,167 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 01:23:35,167 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 01:23:35,168 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 01:23:35,168 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 01:23:35,168 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 01:23:35,168 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc_true-termination.c.i_Iteration2_Lasso [2018-11-23 01:23:35,168 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 01:23:35,168 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 01:23:35,190 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 01:23:35,197 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 01:23:35,205 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 01:23:35,208 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 01:23:35,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 01:23:35,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 01:23:35,509 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 01:23:35,512 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 01:23:35,513 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 01:23:35,514 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 01:23:35,515 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 01:23:35,516 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 01:23:35,517 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 01:23:35,519 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 01:23:35,520 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 01:23:35,522 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 01:23:35,523 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 01:23:35,525 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 01:23:35,527 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 01:23:35,915 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 01:23:35,918 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 01:23:35,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:35,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:35,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:23:35,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:35,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:35,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:35,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:23:35,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:23:35,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:35,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:35,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:35,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:23:35,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:35,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:35,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:35,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:23:35,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:23:35,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:35,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:35,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:35,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:35,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:35,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:35,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:23:35,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:23:35,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:35,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:35,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:35,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:35,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:35,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:35,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:23:35,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:23:35,973 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 01:23:35,991 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 01:23:35,991 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 01:23:35,993 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 01:23:35,994 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 01:23:35,994 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 01:23:35,995 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 Supporting invariants [] [2018-11-23 01:23:36,021 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 01:23:36,028 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 01:23:36,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:23:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:23:36,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:23:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:23:36,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:23:36,111 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 01:23:36,114 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 01:23:36,114 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 01:23:36,152 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 01:23:36,153 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 01:23:36,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 01:23:36,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-11-23 01:23:36,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-23 01:23:36,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:23:36,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-23 01:23:36,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:23:36,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-23 01:23:36,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:23:36,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-23 01:23:36,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 01:23:36,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-11-23 01:23:36,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 01:23:36,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 01:23:36,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-23 01:23:36,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 01:23:36,158 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 01:23:36,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-23 01:23:36,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 01:23:36,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 01:23:36,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-23 01:23:36,159 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 01:23:36,160 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 01:23:36,160 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 01:23:36,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-23 01:23:36,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 01:23:36,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:23:36,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:23:36,160 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:23:36,160 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 01:23:36,160 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, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 182#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 184#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 194#L372-5 [2018-11-23 01:23:36,161 INFO L796 eck$LassoCheckResult]: Loop: 194#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 189#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 190#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 194#L372-5 [2018-11-23 01:23:36,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:23:36,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-23 01:23:36,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:23:36,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:23:36,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:36,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:23:36,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:23:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:23:36,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:23:36,179 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-11-23 01:23:36,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:23:36,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:23:36,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:36,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:23:36,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:23:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:23:36,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:23:36,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-11-23 01:23:36,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:23:36,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:23:36,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:36,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:23:36,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:23:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:23:36,554 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-11-23 01:23:36,625 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 01:23:36,625 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 01:23:36,626 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 01:23:36,626 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 01:23:36,626 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 01:23:36,626 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 01:23:36,626 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 01:23:36,626 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 01:23:36,626 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc_true-termination.c.i_Iteration3_Lasso [2018-11-23 01:23:36,626 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 01:23:36,626 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 01:23:36,629 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 01:23:36,631 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 01:23:36,632 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 01:23:36,633 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 01:23:36,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:23:36,637 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 01:23:36,856 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 01:23:36,857 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 01:23:36,858 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 01:23:36,859 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 01:23:36,860 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 01:23:36,861 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 01:23:36,863 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 01:23:36,864 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 01:23:36,865 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 01:23:36,866 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 01:23:36,867 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 01:23:36,868 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 01:23:36,869 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 01:23:37,240 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 01:23:37,240 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 01:23:37,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:37,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:37,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:23:37,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:37,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:37,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:37,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:23:37,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:23:37,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:37,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:37,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:37,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:23:37,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:37,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:37,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:37,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:23:37,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:23:37,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:37,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:37,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:37,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:23:37,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:37,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:37,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:37,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:23:37,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:23:37,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:37,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:37,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:37,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:23:37,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:37,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:37,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:37,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:23:37,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:23:37,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:37,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:37,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:37,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:37,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:37,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:37,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:23:37,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:23:37,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:37,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 01:23:37,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:37,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:37,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:37,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:37,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:23:37,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:23:37,282 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 01:23:37,303 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 01:23:37,303 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 01:23:37,303 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 01:23:37,304 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 01:23:37,304 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 01:23:37,304 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-11-23 01:23:37,359 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-23 01:23:37,360 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 01:23:37,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:23:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:23:37,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:23:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:23:37,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:23:37,406 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 01:23:37,406 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 01:23:37,407 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-23 01:23:37,443 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2018-11-23 01:23:37,443 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 01:23:37,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 01:23:37,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 01:23:37,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 01:23:37,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:23:37,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 01:23:37,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:23:37,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-23 01:23:37,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:23:37,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-23 01:23:37,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 01:23:37,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-11-23 01:23:37,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 01:23:37,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 01:23:37,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-23 01:23:37,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 01:23:37,447 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-23 01:23:37,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-23 01:23:37,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-23 01:23:37,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 01:23:37,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-11-23 01:23:37,451 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 01:23:37,451 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 01:23:37,451 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 01:23:37,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-11-23 01:23:37,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 01:23:37,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:23:37,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:23:37,453 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:23:37,453 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 01:23:37,453 INFO L794 eck$LassoCheckResult]: Stem: 374#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 367#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, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 368#L382 assume !(main_~length1~0 < 1); 369#L382-2 assume !(main_~length2~0 < 1); 366#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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 362#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 363#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 376#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 372#L372-1 assume !cstrspn_#t~short210; 373#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208; 358#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 359#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 360#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 361#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 365#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 375#L372-5 [2018-11-23 01:23:37,453 INFO L796 eck$LassoCheckResult]: Loop: 375#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 370#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 371#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 375#L372-5 [2018-11-23 01:23:37,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:23:37,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-11-23 01:23:37,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:23:37,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:23:37,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:37,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:23:37,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:23:37,513 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 01:23:37,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:23:37,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 01:23:37,514 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 01:23:37,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:23:37,514 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-11-23 01:23:37,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:23:37,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:23:37,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:37,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:23:37,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:23:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:23:37,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 01:23:37,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:23:37,619 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-23 01:23:37,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:23:37,662 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2018-11-23 01:23:37,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 01:23:37,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2018-11-23 01:23:37,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 01:23:37,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2018-11-23 01:23:37,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 01:23:37,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 01:23:37,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-11-23 01:23:37,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 01:23:37,664 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-23 01:23:37,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-11-23 01:23:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-23 01:23:37,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 01:23:37,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-11-23 01:23:37,665 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 01:23:37,665 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 01:23:37,665 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 01:23:37,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-11-23 01:23:37,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 01:23:37,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:23:37,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:23:37,666 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:23:37,666 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 01:23:37,666 INFO L794 eck$LassoCheckResult]: Stem: 442#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 439#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, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 440#L382 assume !(main_~length1~0 < 1); 441#L382-2 assume !(main_~length2~0 < 1); 438#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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 434#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 435#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 448#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 452#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 451#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208; 430#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 431#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 432#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 433#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 437#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 447#L372-5 [2018-11-23 01:23:37,666 INFO L796 eck$LassoCheckResult]: Loop: 447#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 443#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 444#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 447#L372-5 [2018-11-23 01:23:37,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:23:37,666 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-11-23 01:23:37,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:23:37,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:23:37,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:37,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:23:37,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:23:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:23:37,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:23:37,687 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-11-23 01:23:37,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:23:37,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:23:37,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:37,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:23:37,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:23:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:23:37,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:23:37,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-11-23 01:23:37,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:23:37,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:23:37,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:37,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:23:37,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:23:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:23:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:23:38,121 WARN L180 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 131 [2018-11-23 01:23:38,644 WARN L180 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 107 [2018-11-23 01:23:38,646 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 01:23:38,646 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 01:23:38,647 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 01:23:38,647 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 01:23:38,647 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 01:23:38,647 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 01:23:38,647 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 01:23:38,647 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 01:23:38,647 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc_true-termination.c.i_Iteration5_Lasso [2018-11-23 01:23:38,647 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 01:23:38,647 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 01:23:38,650 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 01:23:38,653 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 01:23:38,654 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 01:23:38,655 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 01:23:38,656 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 01:23:38,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:23:38,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:23:38,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:23:38,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:23:38,665 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 01:23:38,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:23:38,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:23:38,669 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 01:23:38,789 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 01:23:39,205 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2018-11-23 01:23:39,277 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 01:23:39,278 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 01:23:39,279 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 01:23:39,280 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 01:23:39,281 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 01:23:39,282 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 01:23:39,637 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-11-23 01:23:39,852 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 01:23:39,852 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 01:23:39,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:39,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:39,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:23:39,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:39,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:39,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:39,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:23:39,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:23:39,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:39,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:39,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:39,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:39,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:39,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:39,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:23:39,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:23:39,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:39,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:39,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:39,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:23:39,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:39,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:39,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:39,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:23:39,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:23:39,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:39,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:39,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:39,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:23:39,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:39,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:39,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:39,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:23:39,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:23:39,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:39,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:39,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:39,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:23:39,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:39,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:39,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:39,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:23:39,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:23:39,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:39,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:39,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:39,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:23:39,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:39,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:39,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:39,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:23:39,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:23:39,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:39,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:39,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:39,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:23:39,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:39,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:39,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:39,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:23:39,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:23:39,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:39,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:39,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:39,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:23:39,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:39,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:39,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:39,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:23:39,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:23:39,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:39,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:39,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:39,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:23:39,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:39,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:39,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:39,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:23:39,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:23:39,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:39,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:39,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:39,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:39,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:39,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:39,870 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:23:39,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:23:39,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:39,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:39,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:39,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:23:39,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:39,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:39,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:39,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:23:39,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:23:39,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:39,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:39,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:39,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:23:39,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:39,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:39,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:39,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:23:39,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:23:39,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:39,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:39,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:39,876 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-23 01:23:39,876 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-23 01:23:39,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:39,903 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2018-11-23 01:23:39,903 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-23 01:23:40,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:40,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 01:23:40,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:40,016 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 01:23:40,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:40,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:40,017 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 01:23:40,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:23:40,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:40,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 01:23:40,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:40,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:40,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:40,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:40,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:23:40,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:23:40,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:40,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 01:23:40,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:40,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:40,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:40,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:40,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:23:40,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:23:40,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:40,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 01:23:40,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:40,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:40,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:40,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:40,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:23:40,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:23:40,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:40,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 01:23:40,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:40,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:40,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:40,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:40,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:23:40,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:23:40,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:40,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:40,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:40,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:40,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:40,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:40,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:23:40,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:23:40,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:40,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:40,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:40,036 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 01:23:40,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:40,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:40,041 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 01:23:40,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:23:40,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:23:40,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:23:40,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:23:40,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:23:40,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:23:40,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:23:40,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:23:40,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:23:40,061 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 01:23:40,075 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 01:23:40,075 INFO L444 ModelExtractionUtils]: 44 out of 49 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 01:23:40,075 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 01:23:40,076 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 01:23:40,076 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 01:23:40,076 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~s2.base)_1, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~s2.base)_1 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-11-23 01:23:40,189 INFO L297 tatePredicateManager]: 27 out of 28 supporting invariants were superfluous and have been removed [2018-11-23 01:23:40,191 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 01:23:40,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:23:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:23:40,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:23:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:23:40,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:23:40,249 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 01:23:40,250 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 01:23:40,250 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-23 01:23:40,281 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2018-11-23 01:23:40,282 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 01:23:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 01:23:40,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-23 01:23:40,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 01:23:40,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:23:40,283 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 01:23:40,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:23:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:23:40,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:23:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:23:40,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:23:40,343 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 01:23:40,343 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 01:23:40,343 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-23 01:23:40,363 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2018-11-23 01:23:40,365 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 01:23:40,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 01:23:40,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-23 01:23:40,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 01:23:40,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:23:40,366 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 01:23:40,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:23:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:23:40,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:23:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:23:40,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:23:40,408 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 01:23:40,408 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 01:23:40,408 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-23 01:23:40,436 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 53 transitions. Complement of second has 4 states. [2018-11-23 01:23:40,437 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 01:23:40,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 01:23:40,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-11-23 01:23:40,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 01:23:40,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:23:40,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 01:23:40,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:23:40,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-23 01:23:40,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:23:40,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-11-23 01:23:40,441 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 01:23:40,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-11-23 01:23:40,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 01:23:40,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 01:23:40,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 01:23:40,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 01:23:40,441 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 01:23:40,441 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 01:23:40,441 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 01:23:40,441 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 01:23:40,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 01:23:40,441 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 01:23:40,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 01:23:40,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:23:40 BoogieIcfgContainer [2018-11-23 01:23:40,447 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 01:23:40,447 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:23:40,447 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:23:40,447 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:23:40,448 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:23:34" (3/4) ... [2018-11-23 01:23:40,450 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 01:23:40,450 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:23:40,450 INFO L168 Benchmark]: Toolchain (without parser) took 6866.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.9 MB). Free memory was 951.1 MB in the beginning and 891.0 MB in the end (delta: 60.1 MB). Peak memory consumption was 361.0 MB. Max. memory is 11.5 GB. [2018-11-23 01:23:40,451 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:23:40,451 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -150.1 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-23 01:23:40,451 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 01:23:40,452 INFO L168 Benchmark]: Boogie Preprocessor took 21.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:23:40,452 INFO L168 Benchmark]: RCFGBuilder took 255.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-11-23 01:23:40,452 INFO L168 Benchmark]: BuchiAutomizer took 6173.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 899.3 MB in the end (delta: 176.5 MB). Peak memory consumption was 356.4 MB. Max. memory is 11.5 GB. [2018-11-23 01:23:40,452 INFO L168 Benchmark]: Witness Printer took 2.96 ms. Allocated memory is still 1.3 GB. Free memory was 899.3 MB in the beginning and 891.0 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2018-11-23 01:23:40,455 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 375.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -150.1 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 255.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6173.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 899.3 MB in the end (delta: 176.5 MB). Peak memory consumption was 356.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.96 ms. Allocated memory is still 1.3 GB. Free memory was 899.3 MB in the beginning and 891.0 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. 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 unknown-#length-unknown[malloc(length2 * sizeof(char))] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s2] + -1 * s and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 108 SDtfs, 110 SDslu, 57 SDs, 0 SdLazy, 97 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital368 mio100 ax100 hnf99 lsp92 ukn71 mio100 lsp30 div137 bol100 ite100 ukn100 eq160 hnf77 smp91 dnf719 smp24 tf100 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 139ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...