./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrcmp-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_14788589-14da-4096-969a-e1d327e20aa3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_14788589-14da-4096-969a-e1d327e20aa3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_14788589-14da-4096-969a-e1d327e20aa3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_14788589-14da-4096-969a-e1d327e20aa3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrcmp-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_14788589-14da-4096-969a-e1d327e20aa3/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_14788589-14da-4096-969a-e1d327e20aa3/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 a25db066a60bbc1bb3542b52091e202af08e4b7e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:03:30,521 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:03:30,522 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:03:30,529 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:03:30,529 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:03:30,530 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:03:30,531 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:03:30,532 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:03:30,533 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:03:30,533 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:03:30,534 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:03:30,534 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:03:30,535 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:03:30,535 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:03:30,536 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:03:30,537 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:03:30,537 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:03:30,539 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:03:30,540 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:03:30,541 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:03:30,542 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:03:30,543 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:03:30,544 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:03:30,544 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:03:30,544 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:03:30,545 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:03:30,546 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:03:30,546 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:03:30,547 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:03:30,547 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:03:30,548 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:03:30,548 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:03:30,548 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:03:30,548 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:03:30,549 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:03:30,550 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:03:30,550 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_14788589-14da-4096-969a-e1d327e20aa3/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 07:03:30,560 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:03:30,560 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:03:30,561 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:03:30,561 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:03:30,561 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:03:30,562 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:03:30,562 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:03:30,562 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:03:30,562 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:03:30,562 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:03:30,562 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:03:30,563 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:03:30,563 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:03:30,563 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:03:30,563 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:03:30,563 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:03:30,563 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:03:30,563 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:03:30,564 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:03:30,564 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:03:30,564 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:03:30,564 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:03:30,564 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:03:30,564 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:03:30,565 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:03:30,565 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:03:30,565 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:03:30,566 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:03:30,566 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_14788589-14da-4096-969a-e1d327e20aa3/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 -> a25db066a60bbc1bb3542b52091e202af08e4b7e [2018-11-10 07:03:30,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:03:30,598 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:03:30,600 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:03:30,601 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:03:30,601 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:03:30,602 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_14788589-14da-4096-969a-e1d327e20aa3/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrcmp-alloca_true-termination.c.i [2018-11-10 07:03:30,641 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_14788589-14da-4096-969a-e1d327e20aa3/bin-2019/uautomizer/data/99ce8f10d/741e84aad4a442db857ff64a68c589fb/FLAGc3023a42a [2018-11-10 07:03:31,021 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:03:31,021 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_14788589-14da-4096-969a-e1d327e20aa3/sv-benchmarks/c/termination-memory-alloca/cstrcmp-alloca_true-termination.c.i [2018-11-10 07:03:31,031 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_14788589-14da-4096-969a-e1d327e20aa3/bin-2019/uautomizer/data/99ce8f10d/741e84aad4a442db857ff64a68c589fb/FLAGc3023a42a [2018-11-10 07:03:31,041 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_14788589-14da-4096-969a-e1d327e20aa3/bin-2019/uautomizer/data/99ce8f10d/741e84aad4a442db857ff64a68c589fb [2018-11-10 07:03:31,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:03:31,045 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:03:31,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:03:31,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:03:31,048 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:03:31,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:03:31" (1/1) ... [2018-11-10 07:03:31,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7f5da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:31, skipping insertion in model container [2018-11-10 07:03:31,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:03:31" (1/1) ... [2018-11-10 07:03:31,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:03:31,089 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:03:31,284 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:03:31,293 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:03:31,328 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:03:31,354 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:03:31,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:31 WrapperNode [2018-11-10 07:03:31,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:03:31,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:03:31,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:03:31,356 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:03:31,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:31" (1/1) ... [2018-11-10 07:03:31,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:31" (1/1) ... [2018-11-10 07:03:31,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:03:31,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:03:31,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:03:31,436 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:03:31,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:31" (1/1) ... [2018-11-10 07:03:31,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:31" (1/1) ... [2018-11-10 07:03:31,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:31" (1/1) ... [2018-11-10 07:03:31,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:31" (1/1) ... [2018-11-10 07:03:31,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:31" (1/1) ... [2018-11-10 07:03:31,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:31" (1/1) ... [2018-11-10 07:03:31,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:31" (1/1) ... [2018-11-10 07:03:31,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:03:31,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:03:31,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:03:31,456 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:03:31,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14788589-14da-4096-969a-e1d327e20aa3/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-10 07:03:31,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 07:03:31,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 07:03:31,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:03:31,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:03:31,739 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:03:31,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:03:31 BoogieIcfgContainer [2018-11-10 07:03:31,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:03:31,740 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:03:31,740 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:03:31,744 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:03:31,745 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:03:31,745 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:03:31" (1/3) ... [2018-11-10 07:03:31,746 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16798881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:03:31, skipping insertion in model container [2018-11-10 07:03:31,746 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:03:31,746 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:31" (2/3) ... [2018-11-10 07:03:31,747 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16798881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:03:31, skipping insertion in model container [2018-11-10 07:03:31,747 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:03:31,747 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:03:31" (3/3) ... [2018-11-10 07:03:31,749 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcmp-alloca_true-termination.c.i [2018-11-10 07:03:31,797 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:03:31,797 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:03:31,797 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:03:31,797 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:03:31,797 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:03:31,798 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:03:31,798 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:03:31,798 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:03:31,798 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:03:31,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-10 07:03:31,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 07:03:31,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:03:31,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:03:31,834 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:03:31,834 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:03:31,834 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:03:31,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-10 07:03:31,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 07:03:31,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:03:31,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:03:31,837 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:03:31,837 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:03:31,842 INFO L793 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 13#L561true assume !(main_~length1~0 < 1); 17#L561-2true assume !(main_~length2~0 < 1); 25#L564-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 18#L569true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L569 19#L569-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L569-1 16#L570true assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.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; 26#L550-10true [2018-11-10 07:03:31,843 INFO L795 eck$LassoCheckResult]: Loop: 26#L550-10true assume true; 15#L550-1true SUMMARY for call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1); srcloc: L550-1 3#L550-2true cstrcmp_#t~short5 := cstrcmp_#t~mem2 != 0; 4#L550-3true assume !cstrcmp_#t~short5; 23#L550-8true assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem2;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~short5;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset + 1;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, cstrcmp_#t~post7.offset + 1;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 26#L550-10true [2018-11-10 07:03:31,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:31,848 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-11-10 07:03:31,849 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:31,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:31,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:31,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:03:31,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:31,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:31,964 INFO L82 PathProgramCache]: Analyzing trace with hash 49686684, now seen corresponding path program 1 times [2018-11-10 07:03:31,964 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:31,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:31,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:31,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:03:31,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:32,016 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-10 07:03:32,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:03:32,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:03:32,021 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:03:32,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:03:32,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:03:32,033 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2018-11-10 07:03:32,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:03:32,051 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-10 07:03:32,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:03:32,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2018-11-10 07:03:32,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 07:03:32,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 16 states and 18 transitions. [2018-11-10 07:03:32,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 07:03:32,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 07:03:32,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2018-11-10 07:03:32,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:03:32,058 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-10 07:03:32,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2018-11-10 07:03:32,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-10 07:03:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 07:03:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-10 07:03:32,080 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-10 07:03:32,080 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-10 07:03:32,080 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:03:32,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2018-11-10 07:03:32,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 07:03:32,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:03:32,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:03:32,081 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:03:32,081 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:03:32,082 INFO L793 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 71#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 72#L561 assume !(main_~length1~0 < 1); 77#L561-2 assume !(main_~length2~0 < 1); 75#L564-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 64#L569 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L569 65#L569-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L569-1 67#L570 assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.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; 73#L550-10 [2018-11-10 07:03:32,082 INFO L795 eck$LassoCheckResult]: Loop: 73#L550-10 assume true; 76#L550-1 SUMMARY for call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1); srcloc: L550-1 62#L550-2 cstrcmp_#t~short5 := cstrcmp_#t~mem2 != 0; 63#L550-3 assume cstrcmp_#t~short5; 66#L550-4 SUMMARY for call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1); srcloc: L550-4 68#L550-5 SUMMARY for call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1); srcloc: L550-5 69#L550-6 cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; 70#L550-8 assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem2;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~short5;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset + 1;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, cstrcmp_#t~post7.offset + 1;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 73#L550-10 [2018-11-10 07:03:32,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:32,082 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-11-10 07:03:32,082 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:32,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:32,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:32,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:03:32,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:32,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:32,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1552599761, now seen corresponding path program 1 times [2018-11-10 07:03:32,112 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:32,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:32,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:32,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:03:32,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:32,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:32,129 INFO L82 PathProgramCache]: Analyzing trace with hash -995262887, now seen corresponding path program 1 times [2018-11-10 07:03:32,129 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:32,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:32,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:32,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:03:32,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:32,296 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2018-11-10 07:03:32,558 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-11-10 07:03:32,640 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:03:32,641 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:03:32,641 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:03:32,642 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:03:32,642 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:03:32,642 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:03:32,642 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:03:32,642 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:03:32,642 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcmp-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 07:03:32,643 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:03:32,643 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:03:32,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:32,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:32,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:32,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:32,670 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-10 07:03:32,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:32,675 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-10 07:03:32,676 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-10 07:03:32,681 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-10 07:03:32,683 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-10 07:03:32,684 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-10 07:03:32,686 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-10 07:03:32,687 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-10 07:03:32,689 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-10 07:03:32,690 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-10 07:03:32,692 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-10 07:03:32,694 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-10 07:03:32,696 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-10 07:03:32,697 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-10 07:03:32,700 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-10 07:03:32,966 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2018-11-10 07:03:33,114 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2018-11-10 07:03:33,114 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-10 07:03:33,117 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-10 07:03:33,119 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-10 07:03:33,121 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-10 07:03:33,557 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:03:33,560 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:03:33,561 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-10 07:03:33,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:33,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:33,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:33,567 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:33,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:33,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:33,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:33,570 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,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-10 07:03:33,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:33,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:33,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:33,573 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:33,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:33,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:33,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:33,575 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,575 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-10 07:03:33,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:33,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:33,582 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:33,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:33,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:33,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:33,584 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,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-10 07:03:33,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:33,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:33,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:33,587 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,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-10 07:03:33,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:33,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:33,596 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,596 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-10 07:03:33,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:33,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:33,601 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,602 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-10 07:03:33,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:33,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:33,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:33,604 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,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-10 07:03:33,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:33,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:33,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:33,607 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,607 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-10 07:03:33,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:33,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:33,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:33,609 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,609 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-10 07:03:33,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:33,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:33,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:33,611 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,612 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-10 07:03:33,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:33,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:33,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:33,614 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,614 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-10 07:03:33,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:33,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:33,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:33,616 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:33,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:33,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:33,621 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,621 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-10 07:03:33,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:33,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:33,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:33,623 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,624 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-10 07:03:33,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:33,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:33,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:33,626 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,626 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-10 07:03:33,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:33,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:33,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:33,628 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,628 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-10 07:03:33,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,629 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:03:33,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,632 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:03:33,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:33,649 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:33,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:33,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:33,654 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:33,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:33,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:33,661 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,661 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-10 07:03:33,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:33,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:33,671 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,672 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-10 07:03:33,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,674 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:33,674 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:33,685 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,686 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-10 07:03:33,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:33,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,686 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 07:03:33,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,687 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:03:33,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:33,690 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,691 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-10 07:03:33,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:33,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:33,695 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:33,696 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-10 07:03:33,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:33,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:33,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:33,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:33,700 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:33,701 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:33,750 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:03:33,785 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 07:03:33,785 INFO L444 ModelExtractionUtils]: 46 out of 55 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-10 07:03:33,787 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:03:33,788 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:03:33,788 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:03:33,789 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s1.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1) = -1*ULTIMATE.start_cstrcmp_~s1.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1 Supporting invariants [] [2018-11-10 07:03:33,842 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2018-11-10 07:03:33,848 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:03:33,850 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 07:03:33,850 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 07:03:33,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:33,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:03:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:33,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:03:33,929 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-10 07:03:33,931 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-10 07:03:33,932 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-11-10 07:03:33,984 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 3. Second operand 5 states. Result 24 states and 27 transitions. Complement of second has 7 states. [2018-11-10 07:03:33,985 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-10 07:03:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 07:03:33,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-10 07:03:33,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 8 letters. Loop has 8 letters. [2018-11-10 07:03:33,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:33,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-10 07:03:33,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:33,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 8 letters. Loop has 16 letters. [2018-11-10 07:03:33,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:33,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2018-11-10 07:03:33,990 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:03:33,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2018-11-10 07:03:33,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 07:03:33,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 07:03:33,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 07:03:33,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:03:33,991 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:03:33,991 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:03:33,991 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:03:33,991 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:03:33,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:03:33,991 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:03:33,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 07:03:33,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:03:33 BoogieIcfgContainer [2018-11-10 07:03:33,996 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:03:33,996 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:03:33,996 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:03:33,996 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:03:33,997 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:03:31" (3/4) ... [2018-11-10 07:03:33,999 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 07:03:33,999 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:03:34,000 INFO L168 Benchmark]: Toolchain (without parser) took 2956.00 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 221.2 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -95.3 MB). Peak memory consumption was 125.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:03:34,001 INFO L168 Benchmark]: CDTParser took 0.13 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-10 07:03:34,001 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.94 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:03:34,002 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 936.0 MB in the beginning and 1.1 GB in the end (delta: -209.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 07:03:34,002 INFO L168 Benchmark]: Boogie Preprocessor took 19.11 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-10 07:03:34,003 INFO L168 Benchmark]: RCFGBuilder took 284.48 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-11-10 07:03:34,003 INFO L168 Benchmark]: BuchiAutomizer took 2255.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 67.2 MB). Peak memory consumption was 137.0 MB. Max. memory is 11.5 GB. [2018-11-10 07:03:34,004 INFO L168 Benchmark]: Witness Printer took 3.43 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-10 07:03:34,007 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.13 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 309.94 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 936.0 MB in the beginning and 1.1 GB in the end (delta: -209.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.11 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 284.48 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2255.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 67.2 MB). Peak memory consumption was 137.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.43 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.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * 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 * s1 + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 40 SDtfs, 14 SDslu, 35 SDs, 0 SdLazy, 20 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital217 mio100 ax108 hnf99 lsp89 ukn109 mio100 lsp42 div100 bol100 ite100 ukn100 eq201 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 5 VariablesLoop: 4 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...