./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrncpy-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c3b218d6-d091-41e2-92a6-a7d017820697/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c3b218d6-d091-41e2-92a6-a7d017820697/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c3b218d6-d091-41e2-92a6-a7d017820697/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c3b218d6-d091-41e2-92a6-a7d017820697/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrncpy-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c3b218d6-d091-41e2-92a6-a7d017820697/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c3b218d6-d091-41e2-92a6-a7d017820697/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 77cd6aa75e9c7e5f4880befb873abc23862925a6 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:12:29,370 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:12:29,371 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:12:29,380 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:12:29,380 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:12:29,381 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:12:29,382 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:12:29,383 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:12:29,385 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:12:29,385 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:12:29,386 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:12:29,386 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:12:29,387 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:12:29,388 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:12:29,389 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:12:29,389 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:12:29,390 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:12:29,391 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:12:29,393 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:12:29,394 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:12:29,395 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:12:29,396 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:12:29,398 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:12:29,398 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:12:29,398 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:12:29,399 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:12:29,399 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:12:29,400 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:12:29,401 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:12:29,401 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:12:29,402 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:12:29,402 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:12:29,402 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:12:29,402 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:12:29,403 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:12:29,403 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:12:29,404 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c3b218d6-d091-41e2-92a6-a7d017820697/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:12:29,415 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:12:29,415 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:12:29,416 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:12:29,417 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:12:29,417 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:12:29,417 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:12:29,417 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:12:29,417 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:12:29,417 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:12:29,417 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:12:29,417 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:12:29,418 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:12:29,418 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:12:29,418 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:12:29,418 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:12:29,418 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:12:29,418 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:12:29,418 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:12:29,418 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:12:29,419 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:12:29,419 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:12:29,419 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:12:29,419 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:12:29,419 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:12:29,419 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:12:29,419 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:12:29,419 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:12:29,422 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:12:29,422 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_c3b218d6-d091-41e2-92a6-a7d017820697/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77cd6aa75e9c7e5f4880befb873abc23862925a6 [2018-10-27 06:12:29,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:12:29,456 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:12:29,459 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:12:29,460 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:12:29,461 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:12:29,461 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c3b218d6-d091-41e2-92a6-a7d017820697/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrncpy-alloca_true-termination.c.i [2018-10-27 06:12:29,510 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c3b218d6-d091-41e2-92a6-a7d017820697/bin-2019/uautomizer/data/597c57e5a/d32805486f5545e2bbde60ea8cfbd9d6/FLAGefc0c3147 [2018-10-27 06:12:29,978 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:12:29,981 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c3b218d6-d091-41e2-92a6-a7d017820697/sv-benchmarks/c/termination-memory-alloca/cstrncpy-alloca_true-termination.c.i [2018-10-27 06:12:29,992 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c3b218d6-d091-41e2-92a6-a7d017820697/bin-2019/uautomizer/data/597c57e5a/d32805486f5545e2bbde60ea8cfbd9d6/FLAGefc0c3147 [2018-10-27 06:12:30,004 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c3b218d6-d091-41e2-92a6-a7d017820697/bin-2019/uautomizer/data/597c57e5a/d32805486f5545e2bbde60ea8cfbd9d6 [2018-10-27 06:12:30,009 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:12:30,010 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:12:30,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:12:30,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:12:30,014 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:12:30,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:12:30" (1/1) ... [2018-10-27 06:12:30,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5db5b40a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:30, skipping insertion in model container [2018-10-27 06:12:30,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:12:30" (1/1) ... [2018-10-27 06:12:30,029 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:12:30,069 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:12:30,331 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:12:30,343 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:12:30,377 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:12:30,408 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:12:30,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:30 WrapperNode [2018-10-27 06:12:30,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:12:30,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:12:30,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:12:30,409 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:12:30,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:30" (1/1) ... [2018-10-27 06:12:30,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:30" (1/1) ... [2018-10-27 06:12:30,507 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:12:30,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:12:30,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:12:30,509 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:12:30,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:30" (1/1) ... [2018-10-27 06:12:30,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:30" (1/1) ... [2018-10-27 06:12:30,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:30" (1/1) ... [2018-10-27 06:12:30,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:30" (1/1) ... [2018-10-27 06:12:30,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:30" (1/1) ... [2018-10-27 06:12:30,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:30" (1/1) ... [2018-10-27 06:12:30,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:30" (1/1) ... [2018-10-27 06:12:30,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:12:30,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:12:30,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:12:30,535 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:12:30,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3b218d6-d091-41e2-92a6-a7d017820697/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:30,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:12:30,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:12:30,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:12:30,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:12:30,923 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:12:30,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:30 BoogieIcfgContainer [2018-10-27 06:12:30,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:12:30,924 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:12:30,925 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:12:30,927 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:12:30,928 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:30,928 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:12:30" (1/3) ... [2018-10-27 06:12:30,929 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@893a5f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:12:30, skipping insertion in model container [2018-10-27 06:12:30,929 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:30,929 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:30" (2/3) ... [2018-10-27 06:12:30,929 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@893a5f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:12:30, skipping insertion in model container [2018-10-27 06:12:30,930 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:30,930 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:30" (3/3) ... [2018-10-27 06:12:30,931 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncpy-alloca_true-termination.c.i [2018-10-27 06:12:30,969 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:12:30,969 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:12:30,970 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:12:30,970 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:12:30,970 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:12:30,970 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:12:30,970 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:12:30,970 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:12:30,970 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:12:30,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-10-27 06:12:31,001 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:12:31,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:31,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:31,007 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:31,007 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:12:31,007 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:12:31,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-10-27 06:12:31,008 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:12:31,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:31,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:31,009 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:31,009 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:12:31,014 INFO L793 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~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; 4#L568true assume !(main_~length~0 < 1); 8#L568-2true assume !(main_~n~0 < 1); 23#L571-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 10#L576true SUMMARY for call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L576 13#L576-1true assume { :begin_inline_cstrncpy } true;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; 20#L553-3true [2018-10-27 06:12:31,014 INFO L795 eck$LassoCheckResult]: Loop: 20#L553-3true assume true; 18#L553-1true 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, cstrncpy_#t~post3.offset + 1;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, cstrncpy_#t~post4.offset + 1; 9#L555true SUMMARY for call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1); srcloc: L555 11#L555-1true SUMMARY for call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); srcloc: L555-1 15#L555-2true assume !(cstrncpy_#t~mem5 == 0);havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset; 20#L553-3true [2018-10-27 06:12:31,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:31,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935495, now seen corresponding path program 1 times [2018-10-27 06:12:31,021 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:31,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:31,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:31,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:31,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:31,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:31,127 INFO L82 PathProgramCache]: Analyzing trace with hash 48855306, now seen corresponding path program 1 times [2018-10-27 06:12:31,128 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:31,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:31,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:31,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:31,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:31,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:31,148 INFO L82 PathProgramCache]: Analyzing trace with hash -795574524, now seen corresponding path program 1 times [2018-10-27 06:12:31,148 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:31,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:31,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:31,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:31,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:31,631 WARN L179 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-10-27 06:12:31,746 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-10-27 06:12:32,400 WARN L179 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2018-10-27 06:12:32,514 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:12:32,515 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:12:32,516 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:12:32,516 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:12:32,516 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:12:32,516 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:32,516 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:12:32,516 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:12:32,516 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca_true-termination.c.i_Iteration1_Lasso [2018-10-27 06:12:32,517 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:12:32,517 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:12:32,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:32,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:33,062 WARN L179 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2018-10-27 06:12:33,249 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2018-10-27 06:12:33,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:33,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:33,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:33,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:33,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:33,902 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:12:33,906 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:12:33,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:33,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:33,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:33,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:33,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:33,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:33,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:33,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:33,915 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:33,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:33,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:33,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:33,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:33,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:33,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:33,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:33,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:33,929 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:33,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:33,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:33,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:33,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:33,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:33,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:33,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:33,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:33,932 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:33,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:33,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:33,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:33,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:33,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:33,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:33,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:33,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:33,937 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:33,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:33,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:33,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:33,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:33,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:33,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:33,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:33,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:33,940 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:33,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:33,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:33,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:33,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:33,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:33,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:33,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:33,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:33,943 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:33,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:33,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:33,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:33,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:33,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:33,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:33,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:33,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:33,949 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:33,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:33,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:33,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:33,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:33,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:33,954 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:33,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:33,961 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:33,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:33,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:33,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:33,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:33,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:33,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:33,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:33,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:33,971 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:33,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:33,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:33,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:33,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:33,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:33,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:33,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:33,988 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:33,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:33,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:33,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:33,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:33,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:33,990 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:33,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:34,002 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:34,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:34,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:34,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:34,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:34,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:34,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:34,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:34,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:34,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:34,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:34,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:34,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:34,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:34,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:34,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:34,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:34,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:34,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:34,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:34,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:34,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:34,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:34,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:34,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:34,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:34,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:34,023 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:34,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:34,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:34,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:34,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:34,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:34,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:34,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:34,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:34,025 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:34,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:34,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:34,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:34,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:34,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:34,027 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:34,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:34,036 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:34,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:34,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:34,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:34,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:34,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:34,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:34,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:34,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:34,042 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:34,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:34,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:34,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:34,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:34,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:34,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:34,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:34,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:34,050 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:34,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:34,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:34,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:34,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:34,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:34,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:34,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:34,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:34,058 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:34,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:34,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:34,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:34,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:34,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:34,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:34,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:34,083 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:34,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:34,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:34,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:34,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:34,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:34,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:34,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:34,090 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:34,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:34,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:34,091 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:12:34,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:34,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:34,093 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:12:34,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:34,117 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:34,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:34,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:34,118 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:12:34,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:34,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:34,122 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:12:34,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:34,137 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:34,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:34,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:34,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:34,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:34,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:34,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:34,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:34,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:34,139 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:34,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:34,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:34,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:34,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:34,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:34,145 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:34,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:34,150 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:34,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:34,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:34,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:34,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:34,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:34,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:34,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:34,156 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:34,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:34,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:34,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:34,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:34,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:34,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:34,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:34,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:34,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:34,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:34,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:34,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:34,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:34,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:34,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:34,184 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:34,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:34,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:34,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:34,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:34,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:34,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:34,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:34,190 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:34,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:34,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:34,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:34,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:34,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:34,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:34,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:34,267 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:12:34,310 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:12:34,310 INFO L444 ModelExtractionUtils]: 61 out of 67 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:12:34,312 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:12:34,314 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:12:34,316 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:12:34,317 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~n) = 1*ULTIMATE.start_cstrncpy_~n Supporting invariants [] [2018-10-27 06:12:34,413 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2018-10-27 06:12:34,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:34,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:34,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:34,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:34,577 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:12:34,578 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 4 states. [2018-10-27 06:12:34,619 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 4 states. Result 43 states and 52 transitions. Complement of second has 5 states. [2018-10-27 06:12:34,620 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 [2018-10-27 06:12:34,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:12:34,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2018-10-27 06:12:34,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 7 letters. Loop has 5 letters. [2018-10-27 06:12:34,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:34,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 12 letters. Loop has 5 letters. [2018-10-27 06:12:34,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:34,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 7 letters. Loop has 10 letters. [2018-10-27 06:12:34,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:34,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 52 transitions. [2018-10-27 06:12:34,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:12:34,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 20 states and 23 transitions. [2018-10-27 06:12:34,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-10-27 06:12:34,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-10-27 06:12:34,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-10-27 06:12:34,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:12:34,642 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-10-27 06:12:34,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-10-27 06:12:34,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-27 06:12:34,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-27 06:12:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-10-27 06:12:34,662 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-10-27 06:12:34,662 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-10-27 06:12:34,662 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:12:34,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-10-27 06:12:34,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:12:34,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:34,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:34,664 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:34,664 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:12:34,664 INFO L793 eck$LassoCheckResult]: Stem: 195#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 179#L568 assume !(main_~length~0 < 1); 180#L568-2 assume !(main_~n~0 < 1); 184#L571-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 188#L576 SUMMARY for call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L576 189#L576-1 assume { :begin_inline_cstrncpy } true;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; 192#L553-3 assume true; 196#L553-1 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, cstrncpy_#t~post3.offset + 1;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, cstrncpy_#t~post4.offset + 1; 185#L555 SUMMARY for call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1); srcloc: L555 187#L555-1 SUMMARY for call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); srcloc: L555-1 190#L555-2 assume cstrncpy_#t~mem5 == 0;havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 178#L558-4 [2018-10-27 06:12:34,664 INFO L795 eck$LassoCheckResult]: Loop: 178#L558-4 assume true; 181#L558-1 cstrncpy_#t~post6 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post6 - 1; 182#L558-2 assume !!(cstrncpy_#t~post6 != 0);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, cstrncpy_#t~post7.offset + 1; 183#L559 SUMMARY for call write~int(0, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, 1); srcloc: L559 177#L559-1 havoc cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset; 178#L558-4 [2018-10-27 06:12:34,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:34,664 INFO L82 PathProgramCache]: Analyzing trace with hash -795574542, now seen corresponding path program 1 times [2018-10-27 06:12:34,665 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:34,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:34,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:34,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:34,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:34,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:34,694 INFO L82 PathProgramCache]: Analyzing trace with hash 63050697, now seen corresponding path program 1 times [2018-10-27 06:12:34,694 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:34,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:34,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:34,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:34,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:34,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:34,703 INFO L82 PathProgramCache]: Analyzing trace with hash 227296120, now seen corresponding path program 1 times [2018-10-27 06:12:34,703 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:34,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:34,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:34,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:34,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:34,944 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-10-27 06:12:35,410 WARN L179 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 133 [2018-10-27 06:12:35,583 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-10-27 06:12:35,584 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:12:35,584 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:12:35,584 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:12:35,584 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:12:35,584 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:12:35,584 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:35,584 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:12:35,584 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:12:35,584 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca_true-termination.c.i_Iteration2_Lasso [2018-10-27 06:12:35,585 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:12:35,585 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:12:35,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:35,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:35,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:35,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:35,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:35,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:35,956 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 109 [2018-10-27 06:12:36,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:36,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:36,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:36,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:36,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:36,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:36,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:36,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:36,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:36,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:36,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:36,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:36,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:36,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:36,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:36,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:36,214 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-27 06:12:36,390 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2018-10-27 06:12:36,737 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-10-27 06:12:36,840 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:12:36,840 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:12:36,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:36,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:36,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:36,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:36,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:36,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:36,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:36,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:36,846 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:36,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:36,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:36,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:36,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:36,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:36,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:36,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:36,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:36,847 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:36,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:36,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:36,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:36,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:36,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:36,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:36,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:36,851 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:36,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:36,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:36,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:36,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:36,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:36,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:36,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:36,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:36,860 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:36,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:36,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:36,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:36,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:36,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:36,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:36,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:36,867 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:36,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:36,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:36,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:36,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:36,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:36,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:36,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:36,870 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:36,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:36,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:36,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:36,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:36,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:36,871 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:36,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:36,878 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:36,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:36,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:36,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:36,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:36,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:36,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:36,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:36,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:36,880 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:36,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:36,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:36,884 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:12:36,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:36,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:36,885 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:12:36,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:36,895 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:36,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:36,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:36,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:36,896 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:12:36,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:36,911 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-10-27 06:12:36,912 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-10-27 06:12:37,084 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:12:37,160 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:12:37,160 INFO L444 ModelExtractionUtils]: 111 out of 121 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-10-27 06:12:37,161 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:12:37,162 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-10-27 06:12:37,162 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:12:37,162 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncpy_~dst~0.base)_2, ULTIMATE.start_cstrncpy_~us~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncpy_~dst~0.base)_2 - 1*ULTIMATE.start_cstrncpy_~us~0.offset Supporting invariants [] [2018-10-27 06:12:37,600 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2018-10-27 06:12:37,631 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:12:38,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:38,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:38,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:38,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:38,356 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-10-27 06:12:38,356 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-10-27 06:12:38,400 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 26 states and 30 transitions. Complement of second has 6 states. [2018-10-27 06:12:38,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:12:38,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:12:38,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-10-27 06:12:38,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 12 letters. Loop has 5 letters. [2018-10-27 06:12:38,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:38,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 17 letters. Loop has 5 letters. [2018-10-27 06:12:38,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:38,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 12 letters. Loop has 10 letters. [2018-10-27 06:12:38,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:38,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2018-10-27 06:12:38,404 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:12:38,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2018-10-27 06:12:38,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:12:38,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:12:38,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:12:38,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:38,404 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:38,404 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:38,404 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:38,404 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:12:38,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:12:38,405 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:12:38,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:12:38,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:12:38 BoogieIcfgContainer [2018-10-27 06:12:38,410 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:12:38,410 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:12:38,410 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:12:38,410 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:12:38,411 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:30" (3/4) ... [2018-10-27 06:12:38,414 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:12:38,414 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:12:38,414 INFO L168 Benchmark]: Toolchain (without parser) took 8404.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.7 MB). Free memory was 957.0 MB in the beginning and 929.5 MB in the end (delta: 27.4 MB). Peak memory consumption was 226.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:38,415 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:12:38,415 INFO L168 Benchmark]: CACSL2BoogieTranslator took 397.70 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 932.8 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:38,416 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 932.8 MB in the beginning and 1.2 GB in the end (delta: -219.4 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:38,417 INFO L168 Benchmark]: Boogie Preprocessor took 25.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:38,418 INFO L168 Benchmark]: RCFGBuilder took 389.33 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:38,418 INFO L168 Benchmark]: BuchiAutomizer took 7485.32 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 44.6 MB). Free memory was 1.1 GB in the beginning and 929.5 MB in the end (delta: 199.2 MB). Peak memory consumption was 243.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:38,419 INFO L168 Benchmark]: Witness Printer took 3.71 ms. Allocated memory is still 1.2 GB. Free memory is still 929.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:12:38,422 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 397.70 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 932.8 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 932.8 MB in the beginning and 1.2 GB in the end (delta: -219.4 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 389.33 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7485.32 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 44.6 MB). Free memory was 1.1 GB in the beginning and 929.5 MB in the end (delta: 199.2 MB). Peak memory consumption was 243.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.71 ms. Allocated memory is still 1.2 GB. Free memory is still 929.5 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[dst] + -1 * us and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 6.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 41 SDtfs, 42 SDslu, 19 SDs, 0 SdLazy, 9 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital246 mio100 ax107 hnf99 lsp90 ukn105 mio100 lsp50 div100 bol100 ite100 ukn100 eq202 hnf88 smp97 dnf117 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 267ms VariablesStem: 23 VariablesLoop: 16 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...