./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrncat_diffterm_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6650cfb7-ba40-4d9a-b7e7-a2dbba289cf7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6650cfb7-ba40-4d9a-b7e7-a2dbba289cf7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6650cfb7-ba40-4d9a-b7e7-a2dbba289cf7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6650cfb7-ba40-4d9a-b7e7-a2dbba289cf7/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrncat_diffterm_alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6650cfb7-ba40-4d9a-b7e7-a2dbba289cf7/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6650cfb7-ba40-4d9a-b7e7-a2dbba289cf7/bin/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.24-cad4683 [2019-11-15 23:46:58,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:46:58,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:46:58,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:46:58,603 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:46:58,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:46:58,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:46:58,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:46:58,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:46:58,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:46:58,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:46:58,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:46:58,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:46:58,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:46:58,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:46:58,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:46:58,615 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:46:58,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:46:58,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:46:58,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:46:58,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:46:58,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:46:58,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:46:58,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:46:58,626 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:46:58,627 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:46:58,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:46:58,627 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:46:58,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:46:58,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:46:58,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:46:58,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:46:58,630 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:46:58,631 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:46:58,632 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:46:58,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:46:58,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:46:58,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:46:58,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:46:58,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:46:58,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:46:58,635 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6650cfb7-ba40-4d9a-b7e7-a2dbba289cf7/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:46:58,651 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:46:58,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:46:58,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:46:58,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:46:58,653 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:46:58,653 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:46:58,654 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:46:58,654 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:46:58,654 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:46:58,654 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:46:58,654 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:46:58,655 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:46:58,655 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:46:58,655 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:46:58,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:46:58,656 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:46:58,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:46:58,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:46:58,656 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:46:58,657 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:46:58,657 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:46:58,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:46:58,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:46:58,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:46:58,658 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:46:58,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:46:58,658 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:46:58,659 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:46:58,660 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:46:58,660 INFO L138 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/run_dir_6650cfb7-ba40-4d9a-b7e7-a2dbba289cf7/bin/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 [2019-11-15 23:46:58,685 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:46:58,696 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:46:58,699 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:46:58,700 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:46:58,701 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:46:58,701 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6650cfb7-ba40-4d9a-b7e7-a2dbba289cf7/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrncat_diffterm_alloca.i [2019-11-15 23:46:58,753 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6650cfb7-ba40-4d9a-b7e7-a2dbba289cf7/bin/uautomizer/data/4376d339a/9db57672910040a9b394cf71ae945cb0/FLAG3b2575fb9 [2019-11-15 23:46:59,206 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:46:59,206 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6650cfb7-ba40-4d9a-b7e7-a2dbba289cf7/sv-benchmarks/c/termination-15/cstrncat_diffterm_alloca.i [2019-11-15 23:46:59,220 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6650cfb7-ba40-4d9a-b7e7-a2dbba289cf7/bin/uautomizer/data/4376d339a/9db57672910040a9b394cf71ae945cb0/FLAG3b2575fb9 [2019-11-15 23:46:59,500 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6650cfb7-ba40-4d9a-b7e7-a2dbba289cf7/bin/uautomizer/data/4376d339a/9db57672910040a9b394cf71ae945cb0 [2019-11-15 23:46:59,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:46:59,503 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:46:59,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:46:59,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:46:59,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:46:59,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:46:59" (1/1) ... [2019-11-15 23:46:59,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a90a57b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:59, skipping insertion in model container [2019-11-15 23:46:59,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:46:59" (1/1) ... [2019-11-15 23:46:59,520 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:46:59,557 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:46:59,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:46:59,917 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:46:59,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:47:00,035 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:47:00,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:00 WrapperNode [2019-11-15 23:47:00,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:47:00,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:47:00,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:47:00,037 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:47:00,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:00" (1/1) ... [2019-11-15 23:47:00,069 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:00" (1/1) ... [2019-11-15 23:47:00,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:47:00,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:47:00,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:47:00,097 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:47:00,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:00" (1/1) ... [2019-11-15 23:47:00,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:00" (1/1) ... [2019-11-15 23:47:00,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:00" (1/1) ... [2019-11-15 23:47:00,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:00" (1/1) ... [2019-11-15 23:47:00,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:00" (1/1) ... [2019-11-15 23:47:00,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:00" (1/1) ... [2019-11-15 23:47:00,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:00" (1/1) ... [2019-11-15 23:47:00,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:47:00,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:47:00,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:47:00,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:47:00,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6650cfb7-ba40-4d9a-b7e7-a2dbba289cf7/bin/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 [2019-11-15 23:47:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:47:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:47:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:47:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:47:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:47:00,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:47:00,489 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:47:00,490 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:47:00,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:47:00 BoogieIcfgContainer [2019-11-15 23:47:00,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:47:00,492 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:47:00,492 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:47:00,495 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:47:00,496 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:47:00,496 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:46:59" (1/3) ... [2019-11-15 23:47:00,497 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f4979df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:47:00, skipping insertion in model container [2019-11-15 23:47:00,497 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:47:00,497 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:00" (2/3) ... [2019-11-15 23:47:00,498 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f4979df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:47:00, skipping insertion in model container [2019-11-15 23:47:00,498 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:47:00,498 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:47:00" (3/3) ... [2019-11-15 23:47:00,499 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncat_diffterm_alloca.i [2019-11-15 23:47:00,544 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:47:00,545 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:47:00,545 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:47:00,545 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:47:00,545 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:47:00,545 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:47:00,546 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:47:00,546 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:47:00,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 23:47:00,579 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 23:47:00,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:47:00,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:47:00,586 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:47:00,586 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:47:00,586 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:47:00,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 23:47:00,588 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 23:47:00,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:47:00,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:47:00,589 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:47:00,589 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:47:00,596 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true 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; 15#L381true assume !(main_~length1~0 < 1); 18#L381-2true assume !(main_~length2~0 < 1); 11#L384-1true assume !(main_~n~0 < 1); 5#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.allocOnStack(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.allocOnStack(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);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; 8#L367-3true [2019-11-15 23:47:00,597 INFO L793 eck$LassoCheckResult]: Loop: 8#L367-3true call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 3#L367-1true 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; 8#L367-3true [2019-11-15 23:47:00,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:00,602 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2019-11-15 23:47:00,610 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:00,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849393068] [2019-11-15 23:47:00,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:00,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:00,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:00,758 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:47:00,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:00,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2019-11-15 23:47:00,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:00,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803883940] [2019-11-15 23:47:00,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:00,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:00,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:00,773 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:47:00,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:00,774 INFO L82 PathProgramCache]: Analyzing trace with hash 180553748, now seen corresponding path program 1 times [2019-11-15 23:47:00,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:00,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430423344] [2019-11-15 23:47:00,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:00,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:00,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:00,850 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:47:01,403 WARN L191 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99 [2019-11-15 23:47:01,564 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-15 23:47:01,576 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:47:01,577 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:47:01,577 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:47:01,578 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:47:01,578 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:47:01,578 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:47:01,578 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:47:01,578 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:47:01,578 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncat_diffterm_alloca.i_Iteration1_Lasso [2019-11-15 23:47:01,578 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:47:01,579 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:47:01,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:01,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:01,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:01,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:01,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:01,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:02,016 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-11-15 23:47:02,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:02,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:02,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:02,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:02,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:02,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:02,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:02,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:02,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:02,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:02,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:02,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:02,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:02,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:02,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:02,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:02,975 WARN L191 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-15 23:47:03,064 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:47:03,069 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:47:03,076 INFO L120 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 [2019-11-15 23:47:03,078 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:03,078 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:03,079 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:03,079 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:03,079 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:03,081 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:03,082 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:03,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:03,087 INFO L120 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 [2019-11-15 23:47:03,090 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:03,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:03,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:03,093 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:03,095 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:47:03,096 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:47:03,099 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:03,100 INFO L120 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 [2019-11-15 23:47:03,100 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:03,101 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:03,101 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:03,101 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:03,101 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:03,102 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:03,102 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:03,103 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:03,103 INFO L120 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 [2019-11-15 23:47:03,104 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:03,104 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:03,105 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:03,105 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:03,105 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:03,105 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:03,105 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:03,106 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:03,107 INFO L120 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 [2019-11-15 23:47:03,107 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:03,108 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:03,108 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:03,108 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:03,108 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:03,109 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:03,109 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:03,110 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:03,111 INFO L120 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 [2019-11-15 23:47:03,112 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:03,112 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:03,112 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:03,112 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:03,119 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:47:03,119 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:47:03,231 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:47:03,293 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-15 23:47:03,293 INFO L444 ModelExtractionUtils]: 37 out of 43 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 23:47:03,296 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:47:03,297 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:47:03,298 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:47:03,298 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncat_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrncat_~s~0.base)_1) = -1*ULTIMATE.start_cstrncat_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrncat_~s~0.base)_1 Supporting invariants [] [2019-11-15 23:47:03,329 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-15 23:47:03,337 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:47:03,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:03,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:47:03,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:03,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:47:03,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:03,423 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 [2019-11-15 23:47:03,424 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-11-15 23:47:03,494 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 53 states and 76 transitions. Complement of second has 7 states. [2019-11-15 23:47:03,496 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 [2019-11-15 23:47:03,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:47:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2019-11-15 23:47:03,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-15 23:47:03,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:47:03,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-15 23:47:03,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:47:03,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 23:47:03,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:47:03,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 76 transitions. [2019-11-15 23:47:03,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:47:03,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 20 states and 27 transitions. [2019-11-15 23:47:03,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 23:47:03,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:47:03,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-11-15 23:47:03,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:47:03,520 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-15 23:47:03,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-11-15 23:47:03,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-15 23:47:03,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 23:47:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-11-15 23:47:03,550 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-15 23:47:03,551 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-15 23:47:03,551 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:47:03,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-11-15 23:47:03,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:47:03,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:47:03,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:47:03,557 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:03,557 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:47:03,557 INFO L791 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 158#L-1 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; 159#L381 assume !(main_~length1~0 < 1); 164#L381-2 assume !(main_~length2~0 < 1); 174#L384-1 assume !(main_~n~0 < 1); 169#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.allocOnStack(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.allocOnStack(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);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; 170#L367-3 call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 160#L367-1 assume !(49 != cstrncat_#t~mem205);havoc cstrncat_#t~mem205; 161#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 176#L369 assume !cstrncat_#t~short209; 172#L369-2 assume !!cstrncat_#t~short209;havoc cstrncat_#t~mem208;havoc cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;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; 175#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 166#L369 [2019-11-15 23:47:03,557 INFO L793 eck$LassoCheckResult]: Loop: 166#L369 assume !cstrncat_#t~short209; 171#L369-2 assume !!cstrncat_#t~short209;havoc cstrncat_#t~mem208;havoc cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;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; 165#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 166#L369 [2019-11-15 23:47:03,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:03,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1662025132, now seen corresponding path program 1 times [2019-11-15 23:47:03,558 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:03,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591365152] [2019-11-15 23:47:03,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:03,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:03,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:03,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591365152] [2019-11-15 23:47:03,659 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:03,659 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:47:03,659 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257772903] [2019-11-15 23:47:03,661 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:47:03,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:03,661 INFO L82 PathProgramCache]: Analyzing trace with hash 76643, now seen corresponding path program 1 times [2019-11-15 23:47:03,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:03,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259742106] [2019-11-15 23:47:03,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:03,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:03,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:03,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259742106] [2019-11-15 23:47:03,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:03,682 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:47:03,682 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128505769] [2019-11-15 23:47:03,683 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:47:03,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:03,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:47:03,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:47:03,686 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-15 23:47:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:03,711 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-11-15 23:47:03,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:47:03,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2019-11-15 23:47:03,713 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:47:03,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2019-11-15 23:47:03,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:47:03,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:47:03,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:47:03,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:47:03,714 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:47:03,714 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:47:03,714 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:47:03,714 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:47:03,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:47:03,714 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:47:03,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:47:03,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:47:03 BoogieIcfgContainer [2019-11-15 23:47:03,725 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:47:03,725 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:47:03,725 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:47:03,726 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:47:03,726 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:47:00" (3/4) ... [2019-11-15 23:47:03,730 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:47:03,730 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:47:03,733 INFO L168 Benchmark]: Toolchain (without parser) took 4228.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 944.7 MB in the beginning and 999.4 MB in the end (delta: -54.6 MB). Peak memory consumption was 102.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:47:03,733 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:47:03,735 INFO L168 Benchmark]: CACSL2BoogieTranslator took 531.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:47:03,735 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:47:03,736 INFO L168 Benchmark]: Boogie Preprocessor took 49.83 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:47:03,737 INFO L168 Benchmark]: RCFGBuilder took 343.81 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. [2019-11-15 23:47:03,738 INFO L168 Benchmark]: BuchiAutomizer took 3233.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.4 MB in the end (delta: 107.0 MB). Peak memory consumption was 107.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:47:03,739 INFO L168 Benchmark]: Witness Printer took 5.29 ms. Allocated memory is still 1.2 GB. Free memory is still 999.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:47:03,746 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 531.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.83 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 343.81 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 3233.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.4 MB in the end (delta: 107.0 MB). Peak memory consumption was 107.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.29 ms. Allocated memory is still 1.2 GB. Free memory is still 999.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[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 3.1s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 2.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 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 19 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 37 SDtfs, 26 SDslu, 23 SDs, 0 SdLazy, 16 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital203 mio100 ax100 hnf98 lsp97 ukn76 mio100 lsp41 div100 bol100 ite100 ukn100 eq187 hnf88 smp100 dnf240 smp97 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms 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...