./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrncpy_diffterm_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3c0b4b2a-c5cc-450a-b49e-bd13e3ad79ec/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3c0b4b2a-c5cc-450a-b49e-bd13e3ad79ec/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3c0b4b2a-c5cc-450a-b49e-bd13e3ad79ec/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3c0b4b2a-c5cc-450a-b49e-bd13e3ad79ec/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrncpy_diffterm_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3c0b4b2a-c5cc-450a-b49e-bd13e3ad79ec/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3c0b4b2a-c5cc-450a-b49e-bd13e3ad79ec/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 42c24f3b8e86bd7db4a5522885bfbc1daa3bcc95 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 13:24:08,069 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:24:08,070 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:24:08,078 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:24:08,079 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:24:08,079 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:24:08,080 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:24:08,081 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:24:08,083 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:24:08,083 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:24:08,084 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:24:08,084 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:24:08,085 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:24:08,085 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:24:08,087 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:24:08,087 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:24:08,088 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:24:08,089 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:24:08,091 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:24:08,092 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:24:08,092 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:24:08,093 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:24:08,095 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:24:08,095 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:24:08,095 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:24:08,096 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:24:08,097 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:24:08,097 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:24:08,098 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:24:08,099 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:24:08,099 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:24:08,100 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:24:08,100 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:24:08,100 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:24:08,101 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:24:08,101 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:24:08,101 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3c0b4b2a-c5cc-450a-b49e-bd13e3ad79ec/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 13:24:08,113 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:24:08,113 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:24:08,114 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:24:08,114 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:24:08,114 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 13:24:08,114 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 13:24:08,114 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 13:24:08,115 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 13:24:08,115 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 13:24:08,115 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 13:24:08,115 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 13:24:08,115 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:24:08,115 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 13:24:08,115 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:24:08,116 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:24:08,116 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 13:24:08,116 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 13:24:08,116 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 13:24:08,116 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:24:08,116 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 13:24:08,116 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:24:08,117 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 13:24:08,117 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:24:08,117 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:24:08,117 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 13:24:08,117 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:24:08,117 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 13:24:08,118 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 13:24:08,120 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 13:24:08,121 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_3c0b4b2a-c5cc-450a-b49e-bd13e3ad79ec/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 -> 42c24f3b8e86bd7db4a5522885bfbc1daa3bcc95 [2018-11-18 13:24:08,144 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:24:08,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:24:08,155 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:24:08,156 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:24:08,157 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:24:08,157 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3c0b4b2a-c5cc-450a-b49e-bd13e3ad79ec/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrncpy_diffterm_alloca_true-termination.c.i [2018-11-18 13:24:08,201 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3c0b4b2a-c5cc-450a-b49e-bd13e3ad79ec/bin-2019/uautomizer/data/2ad58999d/6ca54667bba5405d9135b39f948cdd7e/FLAG47fc3e3c9 [2018-11-18 13:24:08,551 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:24:08,552 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3c0b4b2a-c5cc-450a-b49e-bd13e3ad79ec/sv-benchmarks/c/termination-15/cstrncpy_diffterm_alloca_true-termination.c.i [2018-11-18 13:24:08,558 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3c0b4b2a-c5cc-450a-b49e-bd13e3ad79ec/bin-2019/uautomizer/data/2ad58999d/6ca54667bba5405d9135b39f948cdd7e/FLAG47fc3e3c9 [2018-11-18 13:24:08,959 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3c0b4b2a-c5cc-450a-b49e-bd13e3ad79ec/bin-2019/uautomizer/data/2ad58999d/6ca54667bba5405d9135b39f948cdd7e [2018-11-18 13:24:08,961 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:24:08,962 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:24:08,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:24:08,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:24:08,965 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:24:08,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:24:08" (1/1) ... [2018-11-18 13:24:08,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b07b9dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:08, skipping insertion in model container [2018-11-18 13:24:08,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:24:08" (1/1) ... [2018-11-18 13:24:08,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:24:08,998 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:24:09,201 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:24:09,209 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:24:09,243 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:24:09,329 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:24:09,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:09 WrapperNode [2018-11-18 13:24:09,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:24:09,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:24:09,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:24:09,330 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:24:09,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:09" (1/1) ... [2018-11-18 13:24:09,344 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:09" (1/1) ... [2018-11-18 13:24:09,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:24:09,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:24:09,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:24:09,358 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:24:09,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:09" (1/1) ... [2018-11-18 13:24:09,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:09" (1/1) ... [2018-11-18 13:24:09,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:09" (1/1) ... [2018-11-18 13:24:09,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:09" (1/1) ... [2018-11-18 13:24:09,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:09" (1/1) ... [2018-11-18 13:24:09,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:09" (1/1) ... [2018-11-18 13:24:09,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:09" (1/1) ... [2018-11-18 13:24:09,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:24:09,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:24:09,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:24:09,376 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:24:09,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c0b4b2a-c5cc-450a-b49e-bd13e3ad79ec/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 13:24:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 13:24:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 13:24:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 13:24:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:24:09,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:24:09,600 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:24:09,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:24:09 BoogieIcfgContainer [2018-11-18 13:24:09,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:24:09,601 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 13:24:09,601 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 13:24:09,605 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 13:24:09,605 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:24:09,605 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 01:24:08" (1/3) ... [2018-11-18 13:24:09,607 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@527f8ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:24:09, skipping insertion in model container [2018-11-18 13:24:09,607 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:24:09,608 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:09" (2/3) ... [2018-11-18 13:24:09,608 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@527f8ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:24:09, skipping insertion in model container [2018-11-18 13:24:09,608 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:24:09,608 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:24:09" (3/3) ... [2018-11-18 13:24:09,610 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncpy_diffterm_alloca_true-termination.c.i [2018-11-18 13:24:09,657 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:24:09,658 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 13:24:09,658 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 13:24:09,658 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 13:24:09,658 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:24:09,658 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:24:09,658 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 13:24:09,659 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:24:09,659 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 13:24:09,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-18 13:24:09,689 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 13:24:09,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:24:09,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:24:09,695 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 13:24:09,695 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 13:24:09,695 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 13:24:09,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-18 13:24:09,696 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 13:24:09,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:24:09,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:24:09,697 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 13:24:09,697 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 13:24:09,703 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.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~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 5#L385true assume !(main_~length~0 < 1); 9#L385-2true assume !(main_~n~0 < 1); 4#L388-1true call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(49, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 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~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, 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; 18#L370-3true [2018-11-18 13:24:09,704 INFO L796 eck$LassoCheckResult]: Loop: 18#L370-3true assume true; 16#L370-1true assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, 1 + cstrncpy_#t~post206.offset;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, 1 + cstrncpy_#t~post207.offset;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 11#L372true assume !(49 == cstrncpy_#t~mem208);havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset; 18#L370-3true [2018-11-18 13:24:09,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:24:09,709 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-18 13:24:09,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:24:09,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:24:09,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:09,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:24:09,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:24:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:24:09,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:24:09,817 INFO L82 PathProgramCache]: Analyzing trace with hash 48869, now seen corresponding path program 1 times [2018-11-18 13:24:09,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:24:09,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:24:09,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:09,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:24:09,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:24:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:24:09,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:24:09,831 INFO L82 PathProgramCache]: Analyzing trace with hash 180428672, now seen corresponding path program 1 times [2018-11-18 13:24:09,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:24:09,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:24:09,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:09,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:24:09,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:24:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:24:10,140 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2018-11-18 13:24:10,211 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:24:10,212 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:24:10,212 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:24:10,212 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:24:10,213 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:24:10,213 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:10,213 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:24:10,213 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:24:10,213 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_diffterm_alloca_true-termination.c.i_Iteration1_Lasso [2018-11-18 13:24:10,213 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:24:10,213 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:24:10,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:10,417 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2018-11-18 13:24:10,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:10,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:10,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:10,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:10,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:10,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:10,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:10,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:10,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:10,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:10,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:10,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:10,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:10,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:10,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:10,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:10,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:10,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:10,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:10,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:10,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:10,900 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:24:10,904 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:24:10,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:24:10,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:24:10,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:10,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:10,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:10,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:24:10,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:24:10,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:24:10,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:24:10,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,955 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:24:10,955 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:24:10,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,967 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:24:10,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,970 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:24:10,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:24:10,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:24:10,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:24:11,044 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:24:11,077 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 13:24:11,077 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 13:24:11,079 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:24:11,080 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 13:24:11,080 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:24:11,081 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~src~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_1) = -1*ULTIMATE.start_cstrncpy_~src~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_1 Supporting invariants [] [2018-11-18 13:24:11,129 INFO L297 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2018-11-18 13:24:11,136 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 13:24:11,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:24:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:24:11,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:24:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:24:11,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:24:11,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:24:11,209 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 13:24:11,210 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 4 states. [2018-11-18 13:24:11,248 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 4 states. Result 31 states and 40 transitions. Complement of second has 6 states. [2018-11-18 13:24:11,248 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-11-18 13:24:11,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:24:11,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-18 13:24:11,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-18 13:24:11,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:24:11,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-18 13:24:11,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:24:11,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-18 13:24:11,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:24:11,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2018-11-18 13:24:11,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 13:24:11,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 13 states and 16 transitions. [2018-11-18 13:24:11,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 13:24:11,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-18 13:24:11,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2018-11-18 13:24:11,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:24:11,261 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-18 13:24:11,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2018-11-18 13:24:11,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-11-18 13:24:11,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 13:24:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2018-11-18 13:24:11,278 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-18 13:24:11,278 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-18 13:24:11,278 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 13:24:11,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2018-11-18 13:24:11,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 13:24:11,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:24:11,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:24:11,279 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:24:11,279 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 13:24:11,279 INFO L794 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 156#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.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~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 157#L385 assume !(main_~length~0 < 1); 162#L385-2 assume !(main_~n~0 < 1); 160#L388-1 call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(49, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 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~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, 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; 161#L370-3 assume true; 163#L370-1 assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, 1 + cstrncpy_#t~post206.offset;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, 1 + cstrncpy_#t~post207.offset;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 153#L372 assume 49 == cstrncpy_#t~mem208;havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 154#L375-4 [2018-11-18 13:24:11,279 INFO L796 eck$LassoCheckResult]: Loop: 154#L375-4 assume true; 158#L375-1 cstrncpy_#t~post209 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post209 - 1; 164#L375-2 assume !!(0 != cstrncpy_#t~post209);havoc cstrncpy_#t~post209;cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_#t~post210.base, 1 + cstrncpy_#t~post210.offset;call write~int(49, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, 1);havoc cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset; 154#L375-4 [2018-11-18 13:24:11,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:24:11,280 INFO L82 PathProgramCache]: Analyzing trace with hash 180428656, now seen corresponding path program 1 times [2018-11-18 13:24:11,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:24:11,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:24:11,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:11,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:24:11,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:24:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:24:11,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:24:11,299 INFO L82 PathProgramCache]: Analyzing trace with hash 61636, now seen corresponding path program 1 times [2018-11-18 13:24:11,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:24:11,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:24:11,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:11,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:24:11,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:24:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:24:11,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:24:11,306 INFO L82 PathProgramCache]: Analyzing trace with hash 2146035445, now seen corresponding path program 1 times [2018-11-18 13:24:11,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:24:11,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:24:11,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:11,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:24:11,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:24:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:24:11,639 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 124 [2018-11-18 13:24:11,742 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:24:11,742 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:24:11,742 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:24:11,742 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:24:11,743 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:24:11,743 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:11,743 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:24:11,743 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:24:11,743 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_diffterm_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-18 13:24:11,743 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:24:11,743 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:24:11,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:11,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:11,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:11,943 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2018-11-18 13:24:11,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:11,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:11,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:11,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:12,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:12,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:12,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:12,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:12,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:12,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:12,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:12,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:12,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:12,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:12,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:12,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:12,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:12,357 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:24:12,357 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:24:12,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:12,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:12,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:12,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:12,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:12,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:12,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:12,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:12,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:12,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:12,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:12,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:12,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:12,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:12,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:12,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:12,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:12,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:12,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:12,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:12,361 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:24:12,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:12,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:12,363 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:24:12,363 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:24:12,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:12,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:12,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:12,371 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:24:12,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:12,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:12,373 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:24:12,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:24:12,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:12,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:12,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:12,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:12,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:12,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:12,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:12,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:12,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:12,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:12,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:12,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:12,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:12,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:12,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:12,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:24:12,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:24:12,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:12,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:12,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:12,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:12,390 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:24:12,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:12,401 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-18 13:24:12,401 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 13:24:12,517 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:24:12,599 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-18 13:24:12,599 INFO L444 ModelExtractionUtils]: 93 out of 101 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-18 13:24:12,600 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:24:12,601 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-18 13:24:12,601 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:24:12,601 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~us~0.offset, v_rep(select #length ULTIMATE.start_cstrncpy_~us~0.base)_1) = -1*ULTIMATE.start_cstrncpy_~us~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrncpy_~us~0.base)_1 Supporting invariants [] [2018-11-18 13:24:12,663 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-18 13:24:12,664 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 13:24:12,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:24:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:24:12,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:24:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:24:12,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:24:12,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:24:12,697 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-18 13:24:12,698 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-18 13:24:12,703 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 15 states and 19 transitions. Complement of second has 4 states. [2018-11-18 13:24:12,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 13:24:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 13:24:12,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-18 13:24:12,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-18 13:24:12,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:24:12,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 13:24:12,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:24:12,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-18 13:24:12,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:24:12,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-11-18 13:24:12,706 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:24:12,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2018-11-18 13:24:12,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 13:24:12,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 13:24:12,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 13:24:12,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:24:12,706 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:24:12,707 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:24:12,707 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:24:12,707 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 13:24:12,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:24:12,707 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:24:12,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 13:24:12,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 01:24:12 BoogieIcfgContainer [2018-11-18 13:24:12,713 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 13:24:12,713 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:24:12,713 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:24:12,713 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:24:12,714 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:24:09" (3/4) ... [2018-11-18 13:24:12,717 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 13:24:12,717 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:24:12,717 INFO L168 Benchmark]: Toolchain (without parser) took 3756.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.8 MB). Free memory was 955.4 MB in the beginning and 1.3 GB in the end (delta: -295.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2018-11-18 13:24:12,718 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-11-18 13:24:12,719 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2018-11-18 13:24:12,719 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.40 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:24:12,720 INFO L168 Benchmark]: Boogie Preprocessor took 18.13 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:24:12,720 INFO L168 Benchmark]: RCFGBuilder took 225.00 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: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-18 13:24:12,720 INFO L168 Benchmark]: BuchiAutomizer took 3111.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -144.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:24:12,721 INFO L168 Benchmark]: Witness Printer took 3.71 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:24:12,724 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 367.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.40 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.13 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 225.00 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: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3111.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -144.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.71 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 -1 * src + unknown-#length-unknown[__builtin_alloca(n * sizeof(char))] and consists of 4 locations. One deterministic module has affine ranking function -1 * us + unknown-#length-unknown[us] and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 27 SDtfs, 27 SDslu, 9 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: inital235 mio100 ax100 hnf99 lsp96 ukn83 mio100 lsp53 div100 bol100 ite100 ukn100 eq201 hnf88 smp100 dnf114 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 212ms VariablesStem: 19 VariablesLoop: 11 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...