./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/cstrcmp_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_38e902b3-1561-4e16-b9ef-6bde29c75dbc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_38e902b3-1561-4e16-b9ef-6bde29c75dbc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_38e902b3-1561-4e16-b9ef-6bde29c75dbc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_38e902b3-1561-4e16-b9ef-6bde29c75dbc/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/cstrcmp_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_38e902b3-1561-4e16-b9ef-6bde29c75dbc/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_38e902b3-1561-4e16-b9ef-6bde29c75dbc/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 256a9ac0f321f0d2863fb720d2ae6cb61570c373 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 08:55:21,287 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:55:21,288 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:55:21,295 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:55:21,296 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:55:21,296 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:55:21,297 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:55:21,298 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:55:21,300 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:55:21,300 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:55:21,301 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:55:21,301 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:55:21,302 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:55:21,303 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:55:21,303 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:55:21,304 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:55:21,305 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:55:21,306 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:55:21,308 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:55:21,308 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:55:21,309 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:55:21,310 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:55:21,312 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:55:21,312 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:55:21,312 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:55:21,313 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:55:21,314 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:55:21,315 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:55:21,315 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:55:21,316 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:55:21,316 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:55:21,316 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:55:21,317 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:55:21,317 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:55:21,317 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:55:21,318 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:55:21,319 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_38e902b3-1561-4e16-b9ef-6bde29c75dbc/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 08:55:21,330 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:55:21,330 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:55:21,331 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:55:21,331 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:55:21,331 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:55:21,332 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 08:55:21,332 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 08:55:21,332 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 08:55:21,332 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 08:55:21,332 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 08:55:21,332 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 08:55:21,332 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:55:21,333 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 08:55:21,333 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:55:21,333 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:55:21,333 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 08:55:21,333 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 08:55:21,333 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 08:55:21,333 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:55:21,333 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 08:55:21,333 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:55:21,334 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 08:55:21,334 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:55:21,334 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:55:21,334 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 08:55:21,334 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:55:21,334 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:55:21,334 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 08:55:21,335 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 08:55:21,335 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_38e902b3-1561-4e16-b9ef-6bde29c75dbc/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 -> 256a9ac0f321f0d2863fb720d2ae6cb61570c373 [2018-11-18 08:55:21,357 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:55:21,366 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:55:21,368 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:55:21,369 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:55:21,369 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:55:21,370 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_38e902b3-1561-4e16-b9ef-6bde29c75dbc/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/cstrcmp_true-termination_true-no-overflow.c [2018-11-18 08:55:21,407 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38e902b3-1561-4e16-b9ef-6bde29c75dbc/bin-2019/uautomizer/data/0f2953098/73c0429ee7664a1abfa7f4108b839617/FLAG68c3cc7ad [2018-11-18 08:55:21,733 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:55:21,733 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_38e902b3-1561-4e16-b9ef-6bde29c75dbc/sv-benchmarks/c/termination-crafted-lit/cstrcmp_true-termination_true-no-overflow.c [2018-11-18 08:55:21,737 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38e902b3-1561-4e16-b9ef-6bde29c75dbc/bin-2019/uautomizer/data/0f2953098/73c0429ee7664a1abfa7f4108b839617/FLAG68c3cc7ad [2018-11-18 08:55:22,166 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_38e902b3-1561-4e16-b9ef-6bde29c75dbc/bin-2019/uautomizer/data/0f2953098/73c0429ee7664a1abfa7f4108b839617 [2018-11-18 08:55:22,169 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:55:22,169 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 08:55:22,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:55:22,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:55:22,172 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:55:22,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:55:22" (1/1) ... [2018-11-18 08:55:22,175 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fe6bbe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:22, skipping insertion in model container [2018-11-18 08:55:22,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:55:22" (1/1) ... [2018-11-18 08:55:22,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:55:22,194 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:55:22,325 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:55:22,331 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:55:22,346 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:55:22,357 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:55:22,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:22 WrapperNode [2018-11-18 08:55:22,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:55:22,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 08:55:22,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 08:55:22,358 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 08:55:22,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:22" (1/1) ... [2018-11-18 08:55:22,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:22" (1/1) ... [2018-11-18 08:55:22,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 08:55:22,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:55:22,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:55:22,385 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:55:22,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:22" (1/1) ... [2018-11-18 08:55:22,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:22" (1/1) ... [2018-11-18 08:55:22,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:22" (1/1) ... [2018-11-18 08:55:22,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:22" (1/1) ... [2018-11-18 08:55:22,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:22" (1/1) ... [2018-11-18 08:55:22,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:22" (1/1) ... [2018-11-18 08:55:22,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:22" (1/1) ... [2018-11-18 08:55:22,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:55:22,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:55:22,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:55:22,405 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:55:22,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38e902b3-1561-4e16-b9ef-6bde29c75dbc/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-18 08:55:22,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 08:55:22,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 08:55:22,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:55:22,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:55:22,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 08:55:22,649 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:55:22,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:55:22 BoogieIcfgContainer [2018-11-18 08:55:22,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:55:22,650 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 08:55:22,650 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 08:55:22,653 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 08:55:22,653 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:55:22,653 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 08:55:22" (1/3) ... [2018-11-18 08:55:22,654 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63d5b848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:55:22, skipping insertion in model container [2018-11-18 08:55:22,654 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:55:22,654 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:55:22" (2/3) ... [2018-11-18 08:55:22,655 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63d5b848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:55:22, skipping insertion in model container [2018-11-18 08:55:22,655 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:55:22,655 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:55:22" (3/3) ... [2018-11-18 08:55:22,656 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcmp_true-termination_true-no-overflow.c [2018-11-18 08:55:22,698 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:55:22,699 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 08:55:22,699 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 08:55:22,699 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 08:55:22,699 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:55:22,699 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:55:22,699 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 08:55:22,700 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:55:22,700 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 08:55:22,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 08:55:22,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:55:22,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:55:22,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:55:22,733 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:55:22,733 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:55:22,733 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 08:55:22,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 08:55:22,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:55:22,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:55:22,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:55:22,735 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:55:22,735 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:55:22,740 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_#t~ret13;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 20#L14true assume !(build_nondet_String_~length~0 < 1); 16#L14-2true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 9#L19true main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 15#L14-3true assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 11#L14-5true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 7#L19-1true main_#t~ret12.base, main_#t~ret12.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 3#L32-6true [2018-11-18 08:55:22,740 INFO L796 eck$LassoCheckResult]: Loop: 3#L32-6true assume true; 13#L32-1true call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 10#L32-2true assume cstrcmp_#t~short5;call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; 6#L32-4true assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem2;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~short5;havoc cstrcmp_#t~mem4;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 3#L32-6true [2018-11-18 08:55:22,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:55:22,745 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2018-11-18 08:55:22,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:55:22,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:55:22,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:55:22,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:55:22,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:55:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:55:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:55:22,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:55:22,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1664427, now seen corresponding path program 1 times [2018-11-18 08:55:22,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:55:22,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:55:22,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:55:22,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:55:22,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:55:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:55:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:55:22,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:55:22,875 INFO L82 PathProgramCache]: Analyzing trace with hash 2010576244, now seen corresponding path program 1 times [2018-11-18 08:55:22,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:55:22,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:55:22,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:55:22,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:55:22,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:55:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:55:23,013 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-18 08:55:23,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:55:23,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 08:55:23,160 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2018-11-18 08:55:23,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 08:55:23,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 08:55:23,213 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 7 states. [2018-11-18 08:55:23,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:55:23,342 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-18 08:55:23,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 08:55:23,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 40 transitions. [2018-11-18 08:55:23,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:55:23,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 14 states and 15 transitions. [2018-11-18 08:55:23,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 08:55:23,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 08:55:23,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2018-11-18 08:55:23,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:55:23,351 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-18 08:55:23,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2018-11-18 08:55:23,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-11-18 08:55:23,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 08:55:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-11-18 08:55:23,369 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-18 08:55:23,370 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-18 08:55:23,370 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 08:55:23,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2018-11-18 08:55:23,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:55:23,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:55:23,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:55:23,370 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:55:23,371 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:55:23,371 INFO L794 eck$LassoCheckResult]: Stem: 83#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 78#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_#t~ret13;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 79#L14 assume !(build_nondet_String_~length~0 < 1); 86#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 87#L19 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 84#L14-3 assume !(build_nondet_String_~length~0 < 1); 85#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 89#L19-1 main_#t~ret12.base, main_#t~ret12.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 82#L32-6 [2018-11-18 08:55:23,371 INFO L796 eck$LassoCheckResult]: Loop: 82#L32-6 assume true; 80#L32-1 call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 81#L32-2 assume cstrcmp_#t~short5;call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; 88#L32-4 assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem2;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~short5;havoc cstrcmp_#t~mem4;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 82#L32-6 [2018-11-18 08:55:23,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:55:23,371 INFO L82 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2018-11-18 08:55:23,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:55:23,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:55:23,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:55:23,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:55:23,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:55:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:55:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:55:23,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:55:23,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1664427, now seen corresponding path program 2 times [2018-11-18 08:55:23,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:55:23,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:55:23,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:55:23,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:55:23,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:55:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:55:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:55:23,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:55:23,406 INFO L82 PathProgramCache]: Analyzing trace with hash -509383690, now seen corresponding path program 1 times [2018-11-18 08:55:23,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:55:23,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:55:23,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:55:23,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:55:23,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:55:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:55:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:55:23,551 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2018-11-18 08:55:23,781 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2018-11-18 08:55:23,857 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:55:23,858 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:55:23,858 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:55:23,858 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:55:23,858 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:55:23,859 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:55:23,859 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:55:23,859 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:55:23,859 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcmp_true-termination_true-no-overflow.c_Iteration2_Lasso [2018-11-18 08:55:23,859 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:55:23,859 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:55:23,875 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-18 08:55:23,879 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-18 08:55:23,881 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-18 08:55:23,886 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-18 08:55:23,887 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-18 08:55:23,889 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-18 08:55:23,890 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-18 08:55:23,891 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-18 08:55:23,895 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-18 08:55:23,896 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-18 08:55:23,898 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-18 08:55:23,899 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-18 08:55:23,900 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-18 08:55:23,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:55:23,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:55:23,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:55:23,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:55:23,909 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-18 08:55:23,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:55:23,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:55:24,069 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2018-11-18 08:55:24,218 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-18 08:55:24,537 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:55:24,541 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:55:24,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 08:55:24,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:55:24,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:55:24,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:55:24,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 08:55:24,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:55:24,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:55:24,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:55:24,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 08:55:24,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:55:24,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:55:24,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 08:55:24,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:55:24,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:55:24,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:55:24,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 08:55:24,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:55:24,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:55:24,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:55:24,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 08:55:24,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:55:24,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:55:24,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:55:24,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 08:55:24,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:55:24,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:55:24,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:55:24,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 08:55:24,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:55:24,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:55:24,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 08:55:24,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:55:24,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:55:24,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:55:24,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 08:55:24,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:55:24,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:55:24,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:55:24,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 08:55:24,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:55:24,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:55:24,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:55:24,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 08:55:24,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:55:24,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:55:24,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:55:24,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:55:24,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:55:24,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:55:24,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:55:24,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:55:24,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:55:24,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:55:24,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:55:24,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 08:55:24,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:55:24,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:55:24,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:55:24,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 08:55:24,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:55:24,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:55:24,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:55:24,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:55:24,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:55:24,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:55:24,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:55:24,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 08:55:24,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:55:24,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:55:24,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:55:24,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 08:55:24,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:55:24,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:55:24,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:55:24,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:55:24,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:55:24,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:55:24,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 08:55:24,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:55:24,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,599 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:55:24,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,600 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:55:24,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:55:24,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 08:55:24,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,607 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:55:24,607 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:55:24,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 08:55:24,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:55:24,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:55:24,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:55:24,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,620 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:55:24,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,622 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:55:24,622 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:55:24,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 08:55:24,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:55:24,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:55:24,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:55:24,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:55:24,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:55:24,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:55:24,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:55:24,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:55:24,647 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:55:24,647 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:55:24,696 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:55:24,726 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 08:55:24,727 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 08:55:24,728 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:55:24,730 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:55:24,731 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:55:24,731 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s2.offset, v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_1) = -1*ULTIMATE.start_cstrcmp_~s2.offset + 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_1 Supporting invariants [] [2018-11-18 08:55:24,777 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-18 08:55:24,784 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 08:55:24,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:55:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:55:24,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:55:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:55:24,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:55:24,853 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-18 08:55:24,855 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-18 08:55:24,856 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 5 states. [2018-11-18 08:55:24,891 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand 5 states. Result 16 states and 18 transitions. Complement of second has 7 states. [2018-11-18 08:55:24,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 08:55:24,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 08:55:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-18 08:55:24,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-18 08:55:24,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:55:24,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 12 letters. Loop has 4 letters. [2018-11-18 08:55:24,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:55:24,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 8 letters. Loop has 8 letters. [2018-11-18 08:55:24,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:55:24,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2018-11-18 08:55:24,895 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:55:24,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2018-11-18 08:55:24,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 08:55:24,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 08:55:24,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 08:55:24,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:55:24,896 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:55:24,896 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:55:24,896 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:55:24,896 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 08:55:24,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 08:55:24,896 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:55:24,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 08:55:24,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 08:55:24 BoogieIcfgContainer [2018-11-18 08:55:24,901 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 08:55:24,901 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:55:24,901 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:55:24,901 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:55:24,901 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:55:22" (3/4) ... [2018-11-18 08:55:24,904 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 08:55:24,904 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:55:24,904 INFO L168 Benchmark]: Toolchain (without parser) took 2735.14 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.5 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -143.0 MB). Peak memory consumption was 83.5 MB. Max. memory is 11.5 GB. [2018-11-18 08:55:24,905 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:55:24,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 188.06 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:55:24,905 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.83 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:55:24,906 INFO L168 Benchmark]: Boogie Preprocessor took 19.17 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:55:24,906 INFO L168 Benchmark]: RCFGBuilder took 245.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -199.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-18 08:55:24,907 INFO L168 Benchmark]: BuchiAutomizer took 2250.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.9 MB). Peak memory consumption was 98.2 MB. Max. memory is 11.5 GB. [2018-11-18 08:55:24,907 INFO L168 Benchmark]: Witness Printer took 2.80 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:55:24,910 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 188.06 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.83 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.17 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 245.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -199.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2250.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.9 MB). Peak memory consumption was 98.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.80 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s2 + unknown-#length-unknown[malloc(length * sizeof(char))] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 36 SDtfs, 42 SDslu, 71 SDs, 0 SdLazy, 61 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital211 mio100 ax100 hnf100 lsp97 ukn84 mio100 lsp50 div100 bol100 ite100 ukn100 eq196 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...