./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrncpy-alloca-1.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_74cef497-2dcb-421b-8cc5-2fa94e4b1842/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_74cef497-2dcb-421b-8cc5-2fa94e4b1842/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_74cef497-2dcb-421b-8cc5-2fa94e4b1842/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_74cef497-2dcb-421b-8cc5-2fa94e4b1842/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrncpy-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_74cef497-2dcb-421b-8cc5-2fa94e4b1842/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_74cef497-2dcb-421b-8cc5-2fa94e4b1842/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 77cd6aa75e9c7e5f4880befb873abc23862925a6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 22:22:35,527 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:22:35,529 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:22:35,541 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:22:35,542 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:22:35,543 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:22:35,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:22:35,553 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:22:35,555 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:22:35,556 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:22:35,557 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:22:35,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:22:35,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:22:35,559 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:22:35,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:22:35,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:22:35,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:22:35,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:22:35,565 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:22:35,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:22:35,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:22:35,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:22:35,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:22:35,576 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:22:35,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:22:35,581 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:22:35,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:22:35,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:22:35,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:22:35,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:22:35,586 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:22:35,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:22:35,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:22:35,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:22:35,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:22:35,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:22:35,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:22:35,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:22:35,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:22:35,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:22:35,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:22:35,598 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_74cef497-2dcb-421b-8cc5-2fa94e4b1842/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 22:22:35,615 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:22:35,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:22:35,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:22:35,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:22:35,620 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:22:35,620 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:22:35,620 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:22:35,620 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:22:35,621 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:22:35,621 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:22:35,622 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:22:35,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:22:35,623 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:22:35,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:22:35,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:22:35,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:22:35,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:22:35,624 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:22:35,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:22:35,624 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:22:35,624 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:22:35,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:22:35,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:22:35,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:22:35,625 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:22:35,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:22:35,626 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:22:35,626 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:22:35,627 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:22:35,627 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_74cef497-2dcb-421b-8cc5-2fa94e4b1842/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 -> 77cd6aa75e9c7e5f4880befb873abc23862925a6 [2019-11-15 22:22:35,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:22:35,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:22:35,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:22:35,691 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:22:35,692 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:22:35,692 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_74cef497-2dcb-421b-8cc5-2fa94e4b1842/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrncpy-alloca-1.i [2019-11-15 22:22:35,760 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74cef497-2dcb-421b-8cc5-2fa94e4b1842/bin/uautomizer/data/af03341c8/695c0018bcb2445399c26b51352621d2/FLAGdd367616c [2019-11-15 22:22:36,192 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:22:36,193 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_74cef497-2dcb-421b-8cc5-2fa94e4b1842/sv-benchmarks/c/termination-memory-alloca/cstrncpy-alloca-1.i [2019-11-15 22:22:36,206 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74cef497-2dcb-421b-8cc5-2fa94e4b1842/bin/uautomizer/data/af03341c8/695c0018bcb2445399c26b51352621d2/FLAGdd367616c [2019-11-15 22:22:36,475 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_74cef497-2dcb-421b-8cc5-2fa94e4b1842/bin/uautomizer/data/af03341c8/695c0018bcb2445399c26b51352621d2 [2019-11-15 22:22:36,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:22:36,478 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:22:36,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:22:36,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:22:36,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:22:36,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:22:36" (1/1) ... [2019-11-15 22:22:36,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef50581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:36, skipping insertion in model container [2019-11-15 22:22:36,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:22:36" (1/1) ... [2019-11-15 22:22:36,491 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:22:36,535 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:22:36,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:22:36,912 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:22:36,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:22:37,004 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:22:37,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:37 WrapperNode [2019-11-15 22:22:37,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:22:37,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:22:37,005 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:22:37,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:22:37,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:37" (1/1) ... [2019-11-15 22:22:37,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:37" (1/1) ... [2019-11-15 22:22:37,049 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:22:37,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:22:37,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:22:37,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:22:37,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:37" (1/1) ... [2019-11-15 22:22:37,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:37" (1/1) ... [2019-11-15 22:22:37,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:37" (1/1) ... [2019-11-15 22:22:37,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:37" (1/1) ... [2019-11-15 22:22:37,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:37" (1/1) ... [2019-11-15 22:22:37,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:37" (1/1) ... [2019-11-15 22:22:37,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:37" (1/1) ... [2019-11-15 22:22:37,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:22:37,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:22:37,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:22:37,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:22:37,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74cef497-2dcb-421b-8cc5-2fa94e4b1842/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 22:22:37,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:22:37,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:22:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:22:37,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:22:37,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:22:37,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:22:37,430 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:22:37,430 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 22:22:37,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:22:37 BoogieIcfgContainer [2019-11-15 22:22:37,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:22:37,432 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:22:37,432 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:22:37,435 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:22:37,435 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:22:37,435 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:22:36" (1/3) ... [2019-11-15 22:22:37,436 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bbc4af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:22:37, skipping insertion in model container [2019-11-15 22:22:37,436 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:22:37,436 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:37" (2/3) ... [2019-11-15 22:22:37,437 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bbc4af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:22:37, skipping insertion in model container [2019-11-15 22:22:37,437 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:22:37,437 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:22:37" (3/3) ... [2019-11-15 22:22:37,438 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncpy-alloca-1.i [2019-11-15 22:22:37,479 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:22:37,479 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:22:37,479 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:22:37,479 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:22:37,480 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:22:37,480 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:22:37,480 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:22:37,480 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:22:37,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-15 22:22:37,513 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 22:22:37,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:22:37,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:22:37,519 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:22:37,520 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:22:37,520 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:22:37,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-15 22:22:37,521 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 22:22:37,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:22:37,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:22:37,522 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:22:37,522 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:22:37,529 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 3#L568true assume !(main_~length~0 < 1); 6#L568-2true assume !(main_~n~0 < 1); 16#L571-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post2, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~post6, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 12#L553-2true [2019-11-15 22:22:37,529 INFO L793 eck$LassoCheckResult]: Loop: 12#L553-2true assume !!(cstrncpy_~n > 0);cstrncpy_#t~post2 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post2 - 1;havoc cstrncpy_#t~post2;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 7#L555true assume !(0 == cstrncpy_#t~mem5);havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~mem5; 12#L553-2true [2019-11-15 22:22:37,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:37,534 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 22:22:37,541 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:37,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998415985] [2019-11-15 22:22:37,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:37,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:37,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:37,668 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:22:37,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:37,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2019-11-15 22:22:37,670 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:37,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837698891] [2019-11-15 22:22:37,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:37,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:37,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:37,703 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:22:37,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:37,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2019-11-15 22:22:37,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:37,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500730267] [2019-11-15 22:22:37,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:37,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:37,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:37,800 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:22:37,925 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-15 22:22:38,367 WARN L191 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2019-11-15 22:22:38,522 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-15 22:22:38,535 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:22:38,536 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:22:38,536 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:22:38,536 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:22:38,536 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:22:38,537 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:22:38,537 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:22:38,537 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:22:38,537 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca-1.i_Iteration1_Lasso [2019-11-15 22:22:38,537 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:22:38,537 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:22:38,579 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 22:22:38,586 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 22:22:38,589 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 22:22:38,593 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 22:22:38,596 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 22:22:38,599 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 22:22:38,601 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 22:22:38,606 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 22:22:38,609 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 22:22:39,023 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-11-15 22:22:39,245 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-11-15 22:22:39,245 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 22:22:39,250 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 22:22:39,253 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 22:22:39,255 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 22:22:39,258 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 22:22:39,260 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 22:22:39,262 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 22:22:39,264 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 22:22:39,266 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 22:22:39,269 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 22:22:39,272 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 22:22:39,275 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 22:22:39,278 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 22:22:39,280 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 22:22:39,283 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 22:22:39,286 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 22:22:39,521 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-15 22:22:40,309 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 22:22:40,384 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:22:40,388 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:22:40,390 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 22:22:40,392 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:40,392 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:40,393 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:40,393 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:40,393 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:40,395 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:40,395 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:40,398 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:40,399 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 22:22:40,399 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:40,399 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:40,399 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:40,400 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:40,400 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:40,400 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:40,400 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:40,401 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:40,402 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 22:22:40,402 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:40,402 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:40,403 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:40,403 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:40,403 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:40,403 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:40,403 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:40,404 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:40,404 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 22:22:40,405 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:40,405 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:40,405 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:40,405 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:40,406 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:40,406 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:40,406 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:40,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:40,407 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 22:22:40,408 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:40,408 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:40,408 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:40,408 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:40,408 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:40,409 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:40,409 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:40,410 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:40,410 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 22:22:40,411 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:40,411 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:40,411 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:40,411 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:40,411 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:40,412 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:40,412 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:40,413 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:40,413 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 22:22:40,413 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:40,414 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:40,414 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:40,414 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:40,416 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:40,416 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:40,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:40,420 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 22:22:40,420 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:40,420 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:40,421 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:40,421 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:40,421 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:40,421 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:40,422 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:40,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:40,423 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 22:22:40,423 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:40,424 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:40,424 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:40,424 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:40,426 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:40,426 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:40,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:40,432 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 22:22:40,432 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:40,432 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:40,432 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:40,433 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:40,435 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:40,436 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:40,451 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:40,451 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 22:22:40,452 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:40,452 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:40,452 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:40,453 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:40,455 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:40,455 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:40,477 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:40,477 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 22:22:40,478 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:40,478 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:40,479 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:40,479 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:40,479 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:40,479 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:40,480 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:40,481 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:40,481 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 22:22:40,482 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:40,482 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:40,482 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:40,482 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:40,484 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:40,484 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:40,487 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:40,487 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 22:22:40,488 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:40,489 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:40,489 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:40,489 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:40,500 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:40,500 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:40,640 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:22:40,730 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:22:40,730 INFO L444 ModelExtractionUtils]: 52 out of 55 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:22:40,733 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:22:40,734 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:22:40,734 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:22:40,735 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~n) = 1*ULTIMATE.start_cstrncpy_~n Supporting invariants [] [2019-11-15 22:22:40,781 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2019-11-15 22:22:40,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:40,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:22:40,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:22:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:40,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:22:40,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:22:40,868 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 22:22:40,883 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 22:22:40,884 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2019-11-15 22:22:40,936 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 5 states. [2019-11-15 22:22:40,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:22:40,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:22:40,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-11-15 22:22:40,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 22:22:40,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:22:40,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 22:22:40,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:22:40,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 22:22:40,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:22:40,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-11-15 22:22:40,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:22:40,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 14 transitions. [2019-11-15 22:22:40,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 22:22:40,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 22:22:40,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-11-15 22:22:40,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:22:40,955 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-15 22:22:40,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-11-15 22:22:40,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-11-15 22:22:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-15 22:22:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-11-15 22:22:40,974 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-15 22:22:40,974 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-15 22:22:40,974 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:22:40,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-11-15 22:22:40,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:22:40,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:22:40,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:22:40,975 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:22:40,975 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:22:40,976 INFO L791 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 141#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 142#L568 assume !(main_~length~0 < 1); 144#L568-2 assume !(main_~n~0 < 1); 150#L571-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post2, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~post6, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 147#L553-2 assume !!(cstrncpy_~n > 0);cstrncpy_#t~post2 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post2 - 1;havoc cstrncpy_#t~post2;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 148#L555 assume 0 == cstrncpy_#t~mem5;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~mem5;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 146#L558-3 [2019-11-15 22:22:40,976 INFO L793 eck$LassoCheckResult]: Loop: 146#L558-3 cstrncpy_#t~post6 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post6 - 1; 145#L558-1 assume !!(0 != cstrncpy_#t~post6);havoc cstrncpy_#t~post6;cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_#t~post7.base, 1 + cstrncpy_#t~post7.offset;call write~int(0, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, 1);havoc cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset; 146#L558-3 [2019-11-15 22:22:40,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:40,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2019-11-15 22:22:40,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:40,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023589904] [2019-11-15 22:22:40,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:40,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:40,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:41,028 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:22:41,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:41,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2019-11-15 22:22:41,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:41,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337202199] [2019-11-15 22:22:41,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:41,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:41,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:41,053 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:22:41,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:41,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2019-11-15 22:22:41,053 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:41,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238144224] [2019-11-15 22:22:41,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:41,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:41,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:41,121 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:22:41,828 WARN L191 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 128 [2019-11-15 22:22:41,958 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-15 22:22:41,960 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:22:41,960 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:22:41,961 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:22:41,961 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:22:41,961 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:22:41,961 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:22:41,961 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:22:41,961 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:22:41,961 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca-1.i_Iteration2_Lasso [2019-11-15 22:22:41,961 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:22:41,961 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:22:41,967 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 22:22:41,970 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 22:22:41,971 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 22:22:41,976 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 22:22:41,979 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 22:22:41,981 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 22:22:41,983 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 22:22:41,985 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 22:22:41,986 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 22:22:41,988 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 22:22:41,990 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 22:22:41,992 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 22:22:41,993 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 22:22:41,995 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 22:22:41,996 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 22:22:41,997 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 22:22:42,000 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 22:22:42,002 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 22:22:42,004 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 22:22:42,006 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 22:22:42,007 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 22:22:42,011 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 22:22:42,340 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-11-15 22:22:43,395 WARN L191 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-11-15 22:22:43,411 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:22:43,411 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:22:43,412 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 22:22:43,412 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,412 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:43,413 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,413 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,413 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,414 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:43,414 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:43,414 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,415 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 22:22:43,415 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,415 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:43,416 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,416 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,416 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,421 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:43,421 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:43,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,423 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 22:22:43,423 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,423 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:43,424 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,424 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,426 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,426 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:43,426 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:43,427 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,428 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 22:22:43,430 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,430 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,430 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,430 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,431 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:43,431 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:43,437 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,438 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 22:22:43,438 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,438 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:43,439 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,439 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,439 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,440 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:43,440 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:43,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,441 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 22:22:43,442 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,442 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,442 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,442 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,450 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:43,450 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:43,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,454 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 22:22:43,455 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,455 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:43,455 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,455 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,456 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,457 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:43,457 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:43,457 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,458 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 22:22:43,458 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,459 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:43,459 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,459 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,459 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,459 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:43,459 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:43,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,461 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 22:22:43,462 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,462 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:43,463 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,463 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,463 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,463 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:43,463 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:43,464 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,465 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 22:22:43,465 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,465 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,465 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,466 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,466 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:43,467 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:43,478 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,479 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 22:22:43,480 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,480 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:43,481 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,481 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,481 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,481 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:43,481 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:43,482 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,482 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 22:22:43,483 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,483 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:43,483 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,483 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,484 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,484 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:43,484 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:43,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,486 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 22:22:43,487 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,487 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:43,487 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,487 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,488 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,488 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:43,488 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:43,489 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,489 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 22:22:43,491 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,491 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:43,491 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,491 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,491 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,492 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:43,492 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:43,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,494 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 22:22:43,495 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,495 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:43,495 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,496 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,496 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,496 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:43,496 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:43,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,498 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 22:22:43,498 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,498 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:43,499 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,499 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,499 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,499 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:43,499 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:43,500 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,500 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 22:22:43,500 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,500 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:43,500 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,501 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,501 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,501 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:43,501 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:43,501 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,502 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 22:22:43,502 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,502 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:43,503 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,503 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,503 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,503 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:43,503 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:43,504 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,504 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 22:22:43,505 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,505 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,505 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,505 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,506 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:43,506 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:43,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,508 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 22:22:43,509 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,509 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:43,509 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,509 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,510 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,510 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:43,510 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:43,511 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,511 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 22:22:43,512 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,512 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,512 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,512 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,513 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:43,513 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:43,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,515 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 22:22:43,516 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,516 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,516 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,516 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,517 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:43,518 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:43,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,523 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 22:22:43,524 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,524 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:43,524 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,524 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,525 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,525 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:43,525 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:43,526 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,526 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 22:22:43,527 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,527 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,527 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,527 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,528 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:43,528 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:43,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,533 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 22:22:43,533 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,533 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,534 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,534 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,534 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:43,535 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:43,536 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,537 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 22:22:43,537 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,537 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,538 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:43,538 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,538 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:43,539 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:43,540 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:43,540 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 22:22:43,541 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:43,541 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:43,541 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 22:22:43,541 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:43,550 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-15 22:22:43,550 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 22:22:43,769 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:22:44,056 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-15 22:22:44,056 INFO L444 ModelExtractionUtils]: 67 out of 81 variables were initially zero. Simplification set additionally 11 variables to zero. [2019-11-15 22:22:44,057 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:22:44,058 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-11-15 22:22:44,058 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:22:44,059 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2, ULTIMATE.start_cstrncpy_~us~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2 - 1*ULTIMATE.start_cstrncpy_~us~0.offset Supporting invariants [] [2019-11-15 22:22:44,104 INFO L297 tatePredicateManager]: 13 out of 15 supporting invariants were superfluous and have been removed [2019-11-15 22:22:44,118 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:22:44,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:44,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 22:22:44,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:22:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:44,203 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:22:44,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:22:44,204 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 22:22:44,204 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-11-15 22:22:44,205 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-15 22:22:44,244 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 12 states and 16 transitions. Complement of second has 5 states. [2019-11-15 22:22:44,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:22:44,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:22:44,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-15 22:22:44,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 22:22:44,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:22:44,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 22:22:44,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:22:44,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 22:22:44,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:22:44,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2019-11-15 22:22:44,248 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:22:44,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-11-15 22:22:44,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:22:44,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:22:44,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:22:44,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:22:44,249 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:22:44,249 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:22:44,249 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:22:44,249 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:22:44,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:22:44,249 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:22:44,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:22:44,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:22:44 BoogieIcfgContainer [2019-11-15 22:22:44,263 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:22:44,264 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:22:44,264 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:22:44,264 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:22:44,265 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:22:37" (3/4) ... [2019-11-15 22:22:44,268 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:22:44,268 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:22:44,270 INFO L168 Benchmark]: Toolchain (without parser) took 7790.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.3 MB). Free memory was 935.7 MB in the beginning and 934.9 MB in the end (delta: 810.5 kB). Peak memory consumption was 212.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:22:44,271 INFO L168 Benchmark]: CDTParser took 0.64 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:22:44,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 525.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -211.5 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:22:44,272 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.57 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 22:22:44,273 INFO L168 Benchmark]: Boogie Preprocessor took 25.32 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:22:44,274 INFO L168 Benchmark]: RCFGBuilder took 357.16 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 22:22:44,275 INFO L168 Benchmark]: BuchiAutomizer took 6831.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.7 MB). Free memory was 1.1 GB in the beginning and 934.9 MB in the end (delta: 183.2 MB). Peak memory consumption was 229.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:22:44,276 INFO L168 Benchmark]: Witness Printer took 4.27 ms. Allocated memory is still 1.2 GB. Free memory is still 934.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:22:44,285 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.64 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 525.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -211.5 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.57 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 25.32 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 357.16 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 6831.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.7 MB). Free memory was 1.1 GB in the beginning and 934.9 MB in the end (delta: 183.2 MB). Peak memory consumption was 229.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.27 ms. Allocated memory is still 1.2 GB. Free memory is still 934.9 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 (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] + -1 * us and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 6.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. 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 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 24 SDslu, 14 SDs, 0 SdLazy, 9 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital242 mio100 ax107 hnf99 lsp90 ukn85 mio100 lsp49 div100 bol100 ite100 ukn100 eq203 hnf85 smp100 dnf173 smp97 tf100 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 518ms VariablesStem: 15 VariablesLoop: 10 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...