./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcmp_mixed_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_e66d2f8a-531d-457c-9bd0-b5d5b44ced65/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e66d2f8a-531d-457c-9bd0-b5d5b44ced65/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e66d2f8a-531d-457c-9bd0-b5d5b44ced65/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e66d2f8a-531d-457c-9bd0-b5d5b44ced65/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e66d2f8a-531d-457c-9bd0-b5d5b44ced65/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e66d2f8a-531d-457c-9bd0-b5d5b44ced65/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 051dd1d5deb7603ef8d45e2ac843d269d4cbaf6c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 08:44:59,699 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:44:59,700 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:44:59,706 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:44:59,707 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:44:59,707 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:44:59,708 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:44:59,709 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:44:59,710 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:44:59,711 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:44:59,712 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:44:59,712 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:44:59,713 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:44:59,713 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:44:59,714 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:44:59,714 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:44:59,714 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:44:59,715 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:44:59,717 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:44:59,717 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:44:59,718 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:44:59,719 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:44:59,721 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:44:59,721 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:44:59,721 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:44:59,722 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:44:59,722 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:44:59,723 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:44:59,724 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:44:59,724 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:44:59,725 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:44:59,725 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:44:59,725 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:44:59,725 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:44:59,726 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:44:59,726 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:44:59,726 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e66d2f8a-531d-457c-9bd0-b5d5b44ced65/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 08:44:59,735 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:44:59,735 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:44:59,736 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 08:44:59,736 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 08:44:59,736 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 08:44:59,736 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 08:44:59,736 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 08:44:59,736 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 08:44:59,737 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 08:44:59,737 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 08:44:59,737 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 08:44:59,737 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:44:59,737 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 08:44:59,737 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:44:59,737 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:44:59,738 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 08:44:59,738 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 08:44:59,738 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 08:44:59,738 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 08:44:59,738 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 08:44:59,738 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 08:44:59,738 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:44:59,739 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 08:44:59,739 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 08:44:59,739 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:44:59,739 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 08:44:59,739 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 08:44:59,740 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 08:44:59,740 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_e66d2f8a-531d-457c-9bd0-b5d5b44ced65/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 -> 051dd1d5deb7603ef8d45e2ac843d269d4cbaf6c [2018-11-10 08:44:59,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:44:59,772 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:44:59,775 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:44:59,776 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:44:59,776 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:44:59,777 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e66d2f8a-531d-457c-9bd0-b5d5b44ced65/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca_true-termination.c.i [2018-11-10 08:44:59,821 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e66d2f8a-531d-457c-9bd0-b5d5b44ced65/bin-2019/uautomizer/data/3519c6670/0fa4f0247add48a195189ea5e9797fa1/FLAGac8c23a7e [2018-11-10 08:45:00,261 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:45:00,262 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e66d2f8a-531d-457c-9bd0-b5d5b44ced65/sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca_true-termination.c.i [2018-11-10 08:45:00,268 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e66d2f8a-531d-457c-9bd0-b5d5b44ced65/bin-2019/uautomizer/data/3519c6670/0fa4f0247add48a195189ea5e9797fa1/FLAGac8c23a7e [2018-11-10 08:45:00,277 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e66d2f8a-531d-457c-9bd0-b5d5b44ced65/bin-2019/uautomizer/data/3519c6670/0fa4f0247add48a195189ea5e9797fa1 [2018-11-10 08:45:00,280 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:45:00,282 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 08:45:00,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:45:00,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:45:00,286 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:45:00,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:45:00" (1/1) ... [2018-11-10 08:45:00,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4943cf3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:45:00, skipping insertion in model container [2018-11-10 08:45:00,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:45:00" (1/1) ... [2018-11-10 08:45:00,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:45:00,326 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:45:00,513 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:45:00,519 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:45:00,549 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:45:00,580 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:45:00,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:45:00 WrapperNode [2018-11-10 08:45:00,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:45:00,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 08:45:00,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 08:45:00,581 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 08:45:00,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:45:00" (1/1) ... [2018-11-10 08:45:00,636 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:45:00" (1/1) ... [2018-11-10 08:45:00,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 08:45:00,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:45:00,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:45:00,650 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:45:00,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:45:00" (1/1) ... [2018-11-10 08:45:00,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:45:00" (1/1) ... [2018-11-10 08:45:00,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:45:00" (1/1) ... [2018-11-10 08:45:00,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:45:00" (1/1) ... [2018-11-10 08:45:00,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:45:00" (1/1) ... [2018-11-10 08:45:00,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:45:00" (1/1) ... [2018-11-10 08:45:00,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:45:00" (1/1) ... [2018-11-10 08:45:00,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:45:00,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:45:00,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:45:00,668 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:45:00,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:45:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e66d2f8a-531d-457c-9bd0-b5d5b44ced65/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 08:45:00,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 08:45:00,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 08:45:00,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:45:00,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:45:00,889 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:45:00,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:45:00 BoogieIcfgContainer [2018-11-10 08:45:00,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:45:00,890 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 08:45:00,890 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 08:45:00,892 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 08:45:00,892 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:45:00,892 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 08:45:00" (1/3) ... [2018-11-10 08:45:00,893 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e7d71bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 08:45:00, skipping insertion in model container [2018-11-10 08:45:00,893 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:45:00,893 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:45:00" (2/3) ... [2018-11-10 08:45:00,893 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e7d71bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 08:45:00, skipping insertion in model container [2018-11-10 08:45:00,893 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:45:00,894 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:45:00" (3/3) ... [2018-11-10 08:45:00,895 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcmp_mixed_alloca_true-termination.c.i [2018-11-10 08:45:00,934 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 08:45:00,935 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 08:45:00,935 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 08:45:00,935 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 08:45:00,935 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 08:45:00,935 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 08:45:00,935 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 08:45:00,935 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 08:45:00,935 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 08:45:00,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-10 08:45:00,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 08:45:00,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:45:00,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:45:00,966 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:45:00,966 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 08:45:00,966 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 08:45:00,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-10 08:45:00,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 08:45:00,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:45:00,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:45:00,969 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:45:00,969 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 08:45:00,976 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~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218, 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~nondet214;havoc main_#t~nondet214;main_~length2~0 := main_#t~nondet215;havoc main_#t~nondet215; 17#L378true assume !(main_~length1~0 < 1); 5#L378-2true assume !(main_~length2~0 < 1); 27#L381-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~malloc216.base, main_#t~malloc216.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~malloc216.base, main_#t~malloc216.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~malloc217.base, main_#t~malloc217.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~malloc217.base, main_#t~malloc217.offset; 19#L386true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L386 20#L386-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + 0, 1); srcloc: L386-1 4#L387true main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;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~post209.base, cstrcmp_#t~post209.offset, cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset, cstrcmp_#t~mem205, cstrcmp_#t~mem206, cstrcmp_#t~mem207, cstrcmp_#t~short208, cstrcmp_#t~mem211, cstrcmp_#t~mem212, cstrcmp_#t~ite213, 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; 28#L367-10true [2018-11-10 08:45:00,976 INFO L795 eck$LassoCheckResult]: Loop: 28#L367-10true assume true; 3#L367-1true SUMMARY for call cstrcmp_#t~mem205 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1); srcloc: L367-1 6#L367-2true cstrcmp_#t~short208 := cstrcmp_#t~mem205 != 0; 7#L367-3true assume !cstrcmp_#t~short208; 26#L367-8true assume !!cstrcmp_#t~short208;havoc cstrcmp_#t~short208;havoc cstrcmp_#t~mem205;havoc cstrcmp_#t~mem207;havoc cstrcmp_#t~mem206;cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset + 1;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset;cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset - 1;havoc cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset; 28#L367-10true [2018-11-10 08:45:00,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:45:00,981 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-11-10 08:45:00,982 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:45:00,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:45:01,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:45:01,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:45:01,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:45:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:45:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:45:01,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:45:01,083 INFO L82 PathProgramCache]: Analyzing trace with hash 49686684, now seen corresponding path program 1 times [2018-11-10 08:45:01,083 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:45:01,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:45:01,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:45:01,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:45:01,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:45:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:45:01,115 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 08:45:01,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:45:01,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:45:01,119 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:45:01,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:45:01,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:45:01,129 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2018-11-10 08:45:01,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:45:01,146 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-10 08:45:01,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:45:01,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2018-11-10 08:45:01,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 08:45:01,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 16 states and 18 transitions. [2018-11-10 08:45:01,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 08:45:01,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 08:45:01,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2018-11-10 08:45:01,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:45:01,153 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-10 08:45:01,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2018-11-10 08:45:01,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-10 08:45:01,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 08:45:01,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-10 08:45:01,175 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-10 08:45:01,175 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-10 08:45:01,175 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 08:45:01,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2018-11-10 08:45:01,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 08:45:01,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:45:01,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:45:01,176 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:45:01,176 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:45:01,177 INFO L793 eck$LassoCheckResult]: Stem: 77#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 74#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218, 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~nondet214;havoc main_#t~nondet214;main_~length2~0 := main_#t~nondet215;havoc main_#t~nondet215; 75#L378 assume !(main_~length1~0 < 1); 66#L378-2 assume !(main_~length2~0 < 1); 67#L381-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~malloc216.base, main_#t~malloc216.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~malloc216.base, main_#t~malloc216.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~malloc217.base, main_#t~malloc217.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~malloc217.base, main_#t~malloc217.offset; 69#L386 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L386 70#L386-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + 0, 1); srcloc: L386-1 64#L387 main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;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~post209.base, cstrcmp_#t~post209.offset, cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset, cstrcmp_#t~mem205, cstrcmp_#t~mem206, cstrcmp_#t~mem207, cstrcmp_#t~short208, cstrcmp_#t~mem211, cstrcmp_#t~mem212, cstrcmp_#t~ite213, 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; 65#L367-10 [2018-11-10 08:45:01,177 INFO L795 eck$LassoCheckResult]: Loop: 65#L367-10 assume true; 62#L367-1 SUMMARY for call cstrcmp_#t~mem205 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1); srcloc: L367-1 63#L367-2 cstrcmp_#t~short208 := cstrcmp_#t~mem205 != 0; 68#L367-3 assume cstrcmp_#t~short208; 71#L367-4 SUMMARY for call cstrcmp_#t~mem206 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1); srcloc: L367-4 72#L367-5 SUMMARY for call cstrcmp_#t~mem207 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1); srcloc: L367-5 73#L367-6 cstrcmp_#t~short208 := cstrcmp_#t~mem206 == cstrcmp_#t~mem207; 76#L367-8 assume !!cstrcmp_#t~short208;havoc cstrcmp_#t~short208;havoc cstrcmp_#t~mem205;havoc cstrcmp_#t~mem207;havoc cstrcmp_#t~mem206;cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset + 1;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset;cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset - 1;havoc cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset; 65#L367-10 [2018-11-10 08:45:01,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:45:01,177 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-11-10 08:45:01,177 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:45:01,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:45:01,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:45:01,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:45:01,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:45:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:45:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:45:01,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:45:01,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1552599761, now seen corresponding path program 1 times [2018-11-10 08:45:01,207 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:45:01,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:45:01,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:45:01,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:45:01,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:45:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:45:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:45:01,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:45:01,222 INFO L82 PathProgramCache]: Analyzing trace with hash -995262887, now seen corresponding path program 1 times [2018-11-10 08:45:01,222 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:45:01,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:45:01,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:45:01,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:45:01,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:45:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:45:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:45:01,377 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2018-11-10 08:45:01,631 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2018-11-10 08:45:01,728 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:45:01,729 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:45:01,729 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:45:01,729 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:45:01,730 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:45:01,730 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:45:01,730 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:45:01,730 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:45:01,730 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcmp_mixed_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 08:45:01,730 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:45:01,731 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:45:01,747 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 08:45:01,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:45:01,752 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 08:45:01,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:45:01,756 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 08:45:01,757 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 08:45:01,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:45:02,003 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2018-11-10 08:45:02,153 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-11-10 08:45:02,153 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 08:45:02,155 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 08:45:02,156 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 08:45:02,157 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 08:45:02,158 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 08:45:02,160 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 08:45:02,161 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 08:45:02,162 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 08:45:02,163 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 08:45:02,164 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 08:45:02,166 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 08:45:02,173 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 08:45:02,174 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 08:45:02,175 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 08:45:02,529 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:45:02,532 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:45:02,533 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 08:45:02,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:45:02,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:45:02,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:45:02,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:45:02,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:45:02,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:45:02,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:45:02,538 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:45:02,538 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 08:45:02,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:45:02,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:45:02,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:45:02,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:45:02,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:45:02,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:45:02,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:45:02,540 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:45:02,541 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 08:45:02,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:45:02,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:45:02,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:45:02,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:45:02,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:45:02,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:45:02,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:45:02,542 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:45:02,542 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 08:45:02,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:45:02,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:45:02,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:45:02,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:45:02,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:45:02,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:45:02,548 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:45:02,548 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 08:45:02,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:45:02,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:45:02,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:45:02,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:45:02,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:45:02,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:45:02,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:45:02,550 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:45:02,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-10 08:45:02,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:45:02,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:45:02,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:45:02,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:45:02,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:45:02,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:45:02,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:45:02,553 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:45:02,553 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 08:45:02,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:45:02,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:45:02,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:45:02,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:45:02,555 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:45:02,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:45:02,559 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:45:02,559 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 08:45:02,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:45:02,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:45:02,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:45:02,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:45:02,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:45:02,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:45:02,567 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:45:02,567 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 08:45:02,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:45:02,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:45:02,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:45:02,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:45:02,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:45:02,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:45:02,635 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:45:02,662 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 08:45:02,662 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 08:45:02,664 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:45:02,664 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 08:45:02,665 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:45:02,665 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s2.offset) = 2*ULTIMATE.start_cstrcmp_~s2.offset + 1 Supporting invariants [] [2018-11-10 08:45:02,712 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-10 08:45:02,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:45:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:45:02,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:45:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:45:02,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:45:02,765 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 08:45:02,767 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 08:45:02,767 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-10 08:45:02,795 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 24 states and 27 transitions. Complement of second has 6 states. [2018-11-10 08:45:02,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 08:45:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 08:45:02,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-10 08:45:02,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 8 letters. [2018-11-10 08:45:02,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:45:02,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-10 08:45:02,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:45:02,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 16 letters. [2018-11-10 08:45:02,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:45:02,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2018-11-10 08:45:02,801 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 08:45:02,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2018-11-10 08:45:02,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 08:45:02,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 08:45:02,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 08:45:02,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:45:02,802 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:45:02,802 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:45:02,802 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:45:02,802 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 08:45:02,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 08:45:02,802 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 08:45:02,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 08:45:02,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 08:45:02 BoogieIcfgContainer [2018-11-10 08:45:02,807 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 08:45:02,808 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 08:45:02,808 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 08:45:02,808 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 08:45:02,808 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:45:00" (3/4) ... [2018-11-10 08:45:02,810 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 08:45:02,811 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 08:45:02,811 INFO L168 Benchmark]: Toolchain (without parser) took 2530.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 957.6 MB in the beginning and 933.7 MB in the end (delta: 24.0 MB). Peak memory consumption was 158.2 MB. Max. memory is 11.5 GB. [2018-11-10 08:45:02,812 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:45:02,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.77 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 929.7 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2018-11-10 08:45:02,813 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 929.7 MB in the beginning and 1.1 GB in the end (delta: -201.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:45:02,813 INFO L168 Benchmark]: Boogie Preprocessor took 17.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:45:02,813 INFO L168 Benchmark]: RCFGBuilder took 221.80 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-10 08:45:02,814 INFO L168 Benchmark]: BuchiAutomizer took 1917.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 933.7 MB in the end (delta: 172.2 MB). Peak memory consumption was 172.2 MB. Max. memory is 11.5 GB. [2018-11-10 08:45:02,814 INFO L168 Benchmark]: Witness Printer took 2.90 ms. Allocated memory is still 1.2 GB. Free memory is still 933.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:45:02,817 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 298.77 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 929.7 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 929.7 MB in the beginning and 1.1 GB in the end (delta: -201.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 221.80 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1917.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 933.7 MB in the end (delta: 172.2 MB). Peak memory consumption was 172.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.90 ms. Allocated memory is still 1.2 GB. Free memory is still 933.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * 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 2 * s2 + 1 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. 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: 45 SDtfs, 15 SDslu, 34 SDs, 0 SdLazy, 10 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital217 mio100 ax100 hnf99 lsp97 ukn111 mio100 lsp43 div100 bol100 ite100 ukn100 eq199 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...