./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrncat_diffterm_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c68b5e7d-86c8-480c-83bc-de4a3348ed34/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c68b5e7d-86c8-480c-83bc-de4a3348ed34/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c68b5e7d-86c8-480c-83bc-de4a3348ed34/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c68b5e7d-86c8-480c-83bc-de4a3348ed34/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrncat_diffterm_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c68b5e7d-86c8-480c-83bc-de4a3348ed34/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c68b5e7d-86c8-480c-83bc-de4a3348ed34/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 0e48acfd964328d443bb00db1a9e4c58c0207581 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 11:11:37,062 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:11:37,063 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:11:37,069 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:11:37,069 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:11:37,070 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:11:37,071 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:11:37,072 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:11:37,073 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:11:37,074 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:11:37,074 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:11:37,075 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:11:37,075 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:11:37,076 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:11:37,076 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:11:37,077 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:11:37,077 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:11:37,079 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:11:37,080 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:11:37,081 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:11:37,082 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:11:37,082 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:11:37,084 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:11:37,084 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:11:37,085 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:11:37,085 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:11:37,086 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:11:37,086 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:11:37,087 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:11:37,088 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:11:37,088 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:11:37,088 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:11:37,088 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:11:37,089 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:11:37,089 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:11:37,090 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:11:37,090 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c68b5e7d-86c8-480c-83bc-de4a3348ed34/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 11:11:37,100 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:11:37,101 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:11:37,102 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:11:37,102 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:11:37,102 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 11:11:37,102 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 11:11:37,102 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 11:11:37,102 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 11:11:37,103 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 11:11:37,103 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 11:11:37,103 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 11:11:37,103 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:11:37,103 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 11:11:37,103 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:11:37,103 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:11:37,103 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 11:11:37,104 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 11:11:37,104 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 11:11:37,104 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:11:37,104 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 11:11:37,104 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:11:37,104 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 11:11:37,104 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:11:37,104 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:11:37,105 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 11:11:37,105 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:11:37,105 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 11:11:37,105 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 11:11:37,106 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 11:11:37,106 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_c68b5e7d-86c8-480c-83bc-de4a3348ed34/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 -> 0e48acfd964328d443bb00db1a9e4c58c0207581 [2018-11-18 11:11:37,129 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:11:37,138 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:11:37,140 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:11:37,141 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:11:37,142 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:11:37,142 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c68b5e7d-86c8-480c-83bc-de4a3348ed34/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrncat_diffterm_alloca_true-termination.c.i [2018-11-18 11:11:37,181 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c68b5e7d-86c8-480c-83bc-de4a3348ed34/bin-2019/uautomizer/data/49d91874e/a650cb6f83eb4fc6b216c5e99d9d10d8/FLAG694dd0393 [2018-11-18 11:11:37,642 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:11:37,642 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c68b5e7d-86c8-480c-83bc-de4a3348ed34/sv-benchmarks/c/termination-15/cstrncat_diffterm_alloca_true-termination.c.i [2018-11-18 11:11:37,652 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c68b5e7d-86c8-480c-83bc-de4a3348ed34/bin-2019/uautomizer/data/49d91874e/a650cb6f83eb4fc6b216c5e99d9d10d8/FLAG694dd0393 [2018-11-18 11:11:38,161 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c68b5e7d-86c8-480c-83bc-de4a3348ed34/bin-2019/uautomizer/data/49d91874e/a650cb6f83eb4fc6b216c5e99d9d10d8 [2018-11-18 11:11:38,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:11:38,164 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:11:38,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:11:38,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:11:38,168 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:11:38,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:11:38" (1/1) ... [2018-11-18 11:11:38,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26de3d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:38, skipping insertion in model container [2018-11-18 11:11:38,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:11:38" (1/1) ... [2018-11-18 11:11:38,177 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:11:38,203 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:11:38,415 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:11:38,423 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:11:38,513 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:11:38,544 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:11:38,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:38 WrapperNode [2018-11-18 11:11:38,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:11:38,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:11:38,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:11:38,545 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:11:38,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:38" (1/1) ... [2018-11-18 11:11:38,560 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:38" (1/1) ... [2018-11-18 11:11:38,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:11:38,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:11:38,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:11:38,576 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:11:38,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:38" (1/1) ... [2018-11-18 11:11:38,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:38" (1/1) ... [2018-11-18 11:11:38,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:38" (1/1) ... [2018-11-18 11:11:38,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:38" (1/1) ... [2018-11-18 11:11:38,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:38" (1/1) ... [2018-11-18 11:11:38,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:38" (1/1) ... [2018-11-18 11:11:38,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:38" (1/1) ... [2018-11-18 11:11:38,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:11:38,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:11:38,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:11:38,594 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:11:38,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c68b5e7d-86c8-480c-83bc-de4a3348ed34/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:11:38,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 11:11:38,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 11:11:38,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 11:11:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 11:11:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:11:38,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:11:38,837 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:11:38,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:11:38 BoogieIcfgContainer [2018-11-18 11:11:38,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:11:38,838 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 11:11:38,838 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 11:11:38,840 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 11:11:38,841 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:11:38,841 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 11:11:38" (1/3) ... [2018-11-18 11:11:38,842 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b5c05d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:11:38, skipping insertion in model container [2018-11-18 11:11:38,842 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:11:38,842 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:38" (2/3) ... [2018-11-18 11:11:38,843 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b5c05d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:11:38, skipping insertion in model container [2018-11-18 11:11:38,843 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:11:38,843 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:11:38" (3/3) ... [2018-11-18 11:11:38,844 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncat_diffterm_alloca_true-termination.c.i [2018-11-18 11:11:38,889 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 11:11:38,890 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 11:11:38,890 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 11:11:38,890 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 11:11:38,890 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:11:38,890 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:11:38,891 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 11:11:38,891 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:11:38,891 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 11:11:38,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-18 11:11:38,918 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 11:11:38,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:11:38,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:11:38,925 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 11:11:38,925 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 11:11:38,925 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 11:11:38,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-18 11:11:38,927 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 11:11:38,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:11:38,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:11:38,928 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 11:11:38,928 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 11:11:38,936 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, 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.base, main_#t~ret218.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~n~0 := main_#t~nondet215;havoc main_#t~nondet215; 17#L381true assume !(main_~length1~0 < 1); 20#L381-2true assume !(main_~length2~0 < 1); 13#L384-1true assume !(main_~n~0 < 1); 6#L387-1true assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);assume { :begin_inline_cstrncat } true;cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset, cstrncat_#t~mem205, cstrncat_#t~post210, cstrncat_#t~post211.base, cstrncat_#t~post211.offset, cstrncat_#t~post207.base, cstrncat_#t~post207.offset, cstrncat_#t~mem208, cstrncat_#t~short209, cstrncat_#t~mem212, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 10#L367-4true [2018-11-18 11:11:38,936 INFO L796 eck$LassoCheckResult]: Loop: 10#L367-4true assume true; 3#L367-1true call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 5#L367-2true assume !!(49 != cstrncat_#t~mem205);havoc cstrncat_#t~mem205;cstrncat_#t~post206.base, cstrncat_#t~post206.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post206.base, 1 + cstrncat_#t~post206.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset; 10#L367-4true [2018-11-18 11:11:38,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:11:38,942 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2018-11-18 11:11:38,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:11:38,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:11:38,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:38,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:11:38,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:11:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:11:39,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:11:39,057 INFO L82 PathProgramCache]: Analyzing trace with hash 58657, now seen corresponding path program 1 times [2018-11-18 11:11:39,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:11:39,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:11:39,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:39,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:11:39,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:11:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:11:39,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:11:39,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1302197843, now seen corresponding path program 1 times [2018-11-18 11:11:39,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:11:39,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:11:39,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:39,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:11:39,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:11:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:11:39,393 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-11-18 11:11:39,490 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:11:39,491 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:11:39,491 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:11:39,492 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:11:39,492 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:11:39,492 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:11:39,492 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:11:39,492 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:11:39,492 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncat_diffterm_alloca_true-termination.c.i_Iteration1_Lasso [2018-11-18 11:11:39,492 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:11:39,493 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:11:39,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:39,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:39,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:39,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:39,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:39,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:39,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:39,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:39,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:39,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:39,806 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2018-11-18 11:11:39,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:39,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:39,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:39,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:39,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:39,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:39,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:39,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:39,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:39,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:39,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:39,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:40,186 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:11:40,190 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:11:40,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:11:40,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:40,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:11:40,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:40,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:40,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:40,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:11:40,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:11:40,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:11:40,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:11:40,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:40,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:40,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:40,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:40,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:11:40,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:11:40,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:11:40,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:11:40,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:40,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:11:40,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:40,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:40,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:40,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:11:40,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:11:40,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:11:40,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:11:40,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:40,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:11:40,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:40,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:40,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:40,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:11:40,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:11:40,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:11:40,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:11:40,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:40,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:11:40,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:40,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:40,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:40,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:11:40,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:11:40,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:11:40,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:11:40,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:40,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:11:40,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:40,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:40,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:40,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:11:40,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:11:40,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:11:40,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:11:40,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:40,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:11:40,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:40,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:40,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:40,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:11:40,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:11:40,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:11:40,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:11:40,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:40,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:11:40,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:40,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:40,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:40,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:11:40,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:11:40,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:11:40,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:11:40,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:40,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:40,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:40,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:40,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:11:40,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:11:40,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:11:40,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:11:40,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:40,227 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:11:40,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:40,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:40,230 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:11:40,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:11:40,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:11:40,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:11:40,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:40,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:40,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:40,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:40,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:11:40,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:11:40,290 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:11:40,316 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 11:11:40,317 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 11:11:40,318 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:11:40,320 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:11:40,320 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:11:40,321 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_1, ULTIMATE.start_cstrncat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_1 - 1*ULTIMATE.start_cstrncat_~s~0.offset Supporting invariants [] [2018-11-18 11:11:40,361 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-18 11:11:40,366 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 11:11:40,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:11:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:11:40,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:11:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:11:40,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:11:40,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:11:40,460 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-18 11:11:40,461 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 4 states. [2018-11-18 11:11:40,531 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 4 states. Result 57 states and 79 transitions. Complement of second has 8 states. [2018-11-18 11:11:40,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 11:11:40,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 11:11:40,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2018-11-18 11:11:40,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-18 11:11:40,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:11:40,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-18 11:11:40,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:11:40,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-18 11:11:40,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:11:40,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 79 transitions. [2018-11-18 11:11:40,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 11:11:40,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 24 states and 31 transitions. [2018-11-18 11:11:40,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 11:11:40,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 11:11:40,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2018-11-18 11:11:40,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:11:40,541 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-11-18 11:11:40,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2018-11-18 11:11:40,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-18 11:11:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 11:11:40,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-11-18 11:11:40,561 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-18 11:11:40,561 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-18 11:11:40,561 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 11:11:40,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-11-18 11:11:40,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 11:11:40,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:11:40,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:11:40,562 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:11:40,562 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:11:40,562 INFO L794 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 186#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, 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.base, main_#t~ret218.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~n~0 := main_#t~nondet215;havoc main_#t~nondet215; 187#L381 assume !(main_~length1~0 < 1); 189#L381-2 assume !(main_~length2~0 < 1); 185#L384-1 assume !(main_~n~0 < 1); 181#L387-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);assume { :begin_inline_cstrncat } true;cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset, cstrncat_#t~mem205, cstrncat_#t~post210, cstrncat_#t~post211.base, cstrncat_#t~post211.offset, cstrncat_#t~post207.base, cstrncat_#t~post207.offset, cstrncat_#t~mem208, cstrncat_#t~short209, cstrncat_#t~mem212, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 182#L367-4 assume true; 177#L367-1 call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 178#L367-2 assume !(49 != cstrncat_#t~mem205);havoc cstrncat_#t~mem205; 179#L369-5 assume true; 184#L369 cstrncat_#t~short209 := 0 != cstrncat_~n; 191#L369-1 assume cstrncat_#t~short209;cstrncat_#t~post207.base, cstrncat_#t~post207.offset := cstrncat_~s2.base, cstrncat_~s2.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#t~post207.base, 1 + cstrncat_#t~post207.offset;call cstrncat_#t~mem208 := read~int(cstrncat_#t~post207.base, cstrncat_#t~post207.offset, 1);call write~int(cstrncat_#t~mem208, cstrncat_~s~0.base, cstrncat_~s~0.offset, 1);cstrncat_#t~short209 := 49 != cstrncat_#t~mem208; 192#L369-3 assume !!cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;havoc cstrncat_#t~mem208;havoc cstrncat_#t~short209;cstrncat_#t~post210 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post210 - 1;havoc cstrncat_#t~post210;cstrncat_#t~post211.base, cstrncat_#t~post211.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post211.base, 1 + cstrncat_#t~post211.offset;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; 193#L369-5 assume true; 183#L369 [2018-11-18 11:11:40,562 INFO L796 eck$LassoCheckResult]: Loop: 183#L369 cstrncat_#t~short209 := 0 != cstrncat_~n; 190#L369-1 assume !cstrncat_#t~short209; 173#L369-3 assume !!cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;havoc cstrncat_#t~mem208;havoc cstrncat_#t~short209;cstrncat_#t~post210 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post210 - 1;havoc cstrncat_#t~post210;cstrncat_#t~post211.base, cstrncat_#t~post211.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post211.base, 1 + cstrncat_#t~post211.offset;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; 174#L369-5 assume true; 183#L369 [2018-11-18 11:11:40,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:11:40,562 INFO L82 PathProgramCache]: Analyzing trace with hash 21554959, now seen corresponding path program 1 times [2018-11-18 11:11:40,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:11:40,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:11:40,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:40,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:11:40,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:11:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:11:40,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:11:40,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2283161, now seen corresponding path program 1 times [2018-11-18 11:11:40,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:11:40,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:11:40,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:40,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:11:40,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:11:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:11:40,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:11:40,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:11:40,626 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:11:40,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:11:40,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:11:40,629 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-18 11:11:40,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:11:40,638 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-11-18 11:11:40,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:11:40,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2018-11-18 11:11:40,640 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:11:40,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2018-11-18 11:11:40,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 11:11:40,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 11:11:40,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 11:11:40,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:11:40,640 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:11:40,640 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:11:40,640 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:11:40,640 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 11:11:40,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 11:11:40,641 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:11:40,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 11:11:40,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 11:11:40 BoogieIcfgContainer [2018-11-18 11:11:40,645 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 11:11:40,646 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:11:40,646 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:11:40,646 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:11:40,646 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:11:38" (3/4) ... [2018-11-18 11:11:40,648 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 11:11:40,649 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:11:40,649 INFO L168 Benchmark]: Toolchain (without parser) took 2485.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 954.4 MB in the beginning and 1.0 GB in the end (delta: -84.3 MB). Peak memory consumption was 36.2 MB. Max. memory is 11.5 GB. [2018-11-18 11:11:40,650 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:11:40,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 954.4 MB in the beginning and 1.1 GB in the end (delta: -148.6 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-18 11:11:40,651 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:11:40,651 INFO L168 Benchmark]: Boogie Preprocessor took 18.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:11:40,652 INFO L168 Benchmark]: RCFGBuilder took 243.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-18 11:11:40,652 INFO L168 Benchmark]: BuchiAutomizer took 1807.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. [2018-11-18 11:11:40,653 INFO L168 Benchmark]: Witness Printer took 2.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:11:40,655 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.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 379.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 954.4 MB in the beginning and 1.1 GB in the end (delta: -148.6 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 243.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1807.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] + -1 * s 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 1.7s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 38 SDtfs, 26 SDslu, 26 SDs, 0 SdLazy, 20 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital198 mio100 ax100 hnf98 lsp96 ukn76 mio100 lsp52 div100 bol100 ite100 ukn100 eq192 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 4 VariablesLoop: 0 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...