./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrncpy_reverse_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_36354b15-7d21-4a4a-90bd-6785523fa58e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_36354b15-7d21-4a4a-90bd-6785523fa58e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_36354b15-7d21-4a4a-90bd-6785523fa58e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_36354b15-7d21-4a4a-90bd-6785523fa58e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrncpy_reverse_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_36354b15-7d21-4a4a-90bd-6785523fa58e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_36354b15-7d21-4a4a-90bd-6785523fa58e/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 cd1d6be80620224d07434e02e12c771f8c62f3e2 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 00:06:53,367 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:06:53,368 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:06:53,374 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:06:53,375 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:06:53,375 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:06:53,376 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:06:53,377 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:06:53,379 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:06:53,379 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:06:53,380 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:06:53,380 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:06:53,381 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:06:53,381 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:06:53,382 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:06:53,382 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:06:53,382 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:06:53,383 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:06:53,385 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:06:53,385 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:06:53,386 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:06:53,387 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:06:53,389 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:06:53,389 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:06:53,389 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:06:53,390 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:06:53,390 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:06:53,390 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:06:53,391 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:06:53,391 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:06:53,391 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:06:53,392 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:06:53,392 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:06:53,392 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:06:53,392 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:06:53,393 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:06:53,393 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_36354b15-7d21-4a4a-90bd-6785523fa58e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 00:06:53,404 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:06:53,404 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:06:53,406 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:06:53,406 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:06:53,406 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:06:53,406 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 00:06:53,406 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 00:06:53,406 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 00:06:53,406 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 00:06:53,407 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 00:06:53,407 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 00:06:53,407 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:06:53,407 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 00:06:53,407 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:06:53,407 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:06:53,407 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 00:06:53,408 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 00:06:53,408 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 00:06:53,408 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:06:53,408 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 00:06:53,408 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:06:53,408 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 00:06:53,408 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:06:53,408 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:06:53,409 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 00:06:53,409 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:06:53,409 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 00:06:53,409 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 00:06:53,410 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 00:06:53,410 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_36354b15-7d21-4a4a-90bd-6785523fa58e/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 -> cd1d6be80620224d07434e02e12c771f8c62f3e2 [2018-11-23 00:06:53,433 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:06:53,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:06:53,446 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:06:53,447 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:06:53,447 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:06:53,448 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_36354b15-7d21-4a4a-90bd-6785523fa58e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrncpy_reverse_alloca_true-termination.c.i [2018-11-23 00:06:53,494 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_36354b15-7d21-4a4a-90bd-6785523fa58e/bin-2019/uautomizer/data/104aab220/ec131423fa3a4d6aaaf3c97ec6dc8e2b/FLAG55130cd98 [2018-11-23 00:06:53,843 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:06:53,844 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_36354b15-7d21-4a4a-90bd-6785523fa58e/sv-benchmarks/c/termination-15/cstrncpy_reverse_alloca_true-termination.c.i [2018-11-23 00:06:53,851 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_36354b15-7d21-4a4a-90bd-6785523fa58e/bin-2019/uautomizer/data/104aab220/ec131423fa3a4d6aaaf3c97ec6dc8e2b/FLAG55130cd98 [2018-11-23 00:06:53,866 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_36354b15-7d21-4a4a-90bd-6785523fa58e/bin-2019/uautomizer/data/104aab220/ec131423fa3a4d6aaaf3c97ec6dc8e2b [2018-11-23 00:06:53,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:06:53,870 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:06:53,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:06:53,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:06:53,874 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:06:53,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:06:53" (1/1) ... [2018-11-23 00:06:53,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce54f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:53, skipping insertion in model container [2018-11-23 00:06:53,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:06:53" (1/1) ... [2018-11-23 00:06:53,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:06:53,911 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:06:54,126 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:06:54,133 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:06:54,214 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:06:54,254 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:06:54,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:54 WrapperNode [2018-11-23 00:06:54,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:06:54,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:06:54,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:06:54,255 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:06:54,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:54" (1/1) ... [2018-11-23 00:06:54,269 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:54" (1/1) ... [2018-11-23 00:06:54,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:06:54,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:06:54,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:06:54,283 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:06:54,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:54" (1/1) ... [2018-11-23 00:06:54,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:54" (1/1) ... [2018-11-23 00:06:54,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:54" (1/1) ... [2018-11-23 00:06:54,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:54" (1/1) ... [2018-11-23 00:06:54,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:54" (1/1) ... [2018-11-23 00:06:54,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:54" (1/1) ... [2018-11-23 00:06:54,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:54" (1/1) ... [2018-11-23 00:06:54,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:06:54,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:06:54,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:06:54,300 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:06:54,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36354b15-7d21-4a4a-90bd-6785523fa58e/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-23 00:06:54,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:06:54,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 00:06:54,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 00:06:54,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 00:06:54,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:06:54,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:06:54,500 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:06:54,501 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 00:06:54,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:06:54 BoogieIcfgContainer [2018-11-23 00:06:54,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:06:54,501 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 00:06:54,501 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 00:06:54,504 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 00:06:54,504 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:06:54,504 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 12:06:53" (1/3) ... [2018-11-23 00:06:54,505 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a2a53d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:06:54, skipping insertion in model container [2018-11-23 00:06:54,505 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:06:54,505 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:54" (2/3) ... [2018-11-23 00:06:54,506 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a2a53d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:06:54, skipping insertion in model container [2018-11-23 00:06:54,506 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:06:54,506 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:06:54" (3/3) ... [2018-11-23 00:06:54,507 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncpy_reverse_alloca_true-termination.c.i [2018-11-23 00:06:54,543 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:06:54,543 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 00:06:54,543 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 00:06:54,543 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 00:06:54,544 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:06:54,544 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:06:54,544 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 00:06:54,544 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:06:54,544 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 00:06:54,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 00:06:54,568 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 00:06:54,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:06:54,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:06:54,573 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 00:06:54,573 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 00:06:54,573 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 00:06:54,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 00:06:54,574 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 00:06:54,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:06:54,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:06:54,575 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 00:06:54,575 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 00:06:54,582 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true 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); 7#L385-2true assume !(main_~n~0 < 1); 3#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(0, main_~nondetString~0.base, main_~nondetString~0.offset, 1);main_~nondetString~0.base, main_~nondetString~0.offset := main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset + (main_~n~0 - 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~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; 14#L370-2true [2018-11-23 00:06:54,582 INFO L796 eck$LassoCheckResult]: Loop: 14#L370-2true 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, cstrncpy_#t~post206.offset - 1;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, cstrncpy_#t~post207.offset - 1;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); 9#L372true assume !(0 == cstrncpy_#t~mem208);havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset; 14#L370-2true [2018-11-23 00:06:54,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:06:54,588 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-23 00:06:54,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:06:54,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:06:54,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:06:54,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:06:54,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:06:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:06:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:06:54,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:06:54,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2018-11-23 00:06:54,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:06:54,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:06:54,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:06:54,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:06:54,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:06:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:06:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:06:54,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:06:54,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2018-11-23 00:06:54,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:06:54,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:06:54,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:06:54,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:06:54,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:06:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:06:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:06:55,047 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2018-11-23 00:06:55,124 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:06:55,125 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:06:55,125 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:06:55,125 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:06:55,126 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:06:55,126 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:06:55,126 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:06:55,126 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:06:55,126 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_reverse_alloca_true-termination.c.i_Iteration1_Lasso [2018-11-23 00:06:55,126 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:06:55,127 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:06:55,150 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-23 00:06:55,157 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-23 00:06:55,159 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-23 00:06:55,161 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-23 00:06:55,170 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-23 00:06:55,173 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-23 00:06:55,174 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-23 00:06:55,379 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2018-11-23 00:06:55,475 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-23 00:06:55,476 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-23 00:06:55,480 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-23 00:06:55,481 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-23 00:06:55,482 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-23 00:06:55,483 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-23 00:06:55,484 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-23 00:06:55,485 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-23 00:06:55,490 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-23 00:06:55,491 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-23 00:06:55,493 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-23 00:06:55,494 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-23 00:06:55,495 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-23 00:06:55,496 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-23 00:06:55,497 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-23 00:06:55,866 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:06:55,869 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:06:55,871 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-23 00:06:55,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:06:55,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:06:55,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:06:55,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:06:55,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:06:55,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:06:55,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:06:55,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:06:55,877 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-23 00:06:55,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:06:55,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:06:55,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:06:55,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:06:55,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:06:55,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:06:55,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:06:55,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:06:55,879 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-23 00:06:55,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:06:55,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:06:55,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:06:55,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:06:55,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:06:55,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:06:55,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:06:55,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:06:55,882 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-23 00:06:55,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:06:55,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:06:55,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:06:55,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:06:55,885 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:06:55,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:06:55,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:06:55,888 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-23 00:06:55,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:06:55,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:06:55,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:06:55,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:06:55,894 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:06:55,894 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:06:55,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:06:55,897 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-23 00:06:55,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:06:55,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:06:55,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:06:55,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:06:55,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:06:55,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:06:55,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:06:55,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:06:55,900 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-23 00:06:55,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:06:55,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:06:55,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:06:55,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:06:55,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:06:55,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:06:55,951 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 00:06:55,970 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 00:06:55,970 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 00:06:55,972 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 00:06:55,974 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 00:06:55,974 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 00:06:55,974 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~dst~0.offset) = 2*ULTIMATE.start_cstrncpy_~dst~0.offset + 1 Supporting invariants [] [2018-11-23 00:06:56,012 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2018-11-23 00:06:56,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:06:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:06:56,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:06:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:06:56,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:06:56,106 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-23 00:06:56,116 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-23 00:06:56,116 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2018-11-23 00:06:56,147 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 5 states. [2018-11-23 00:06:56,148 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-23 00:06:56,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 00:06:56,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 00:06:56,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-23 00:06:56,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:06:56,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-23 00:06:56,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:06:56,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-23 00:06:56,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:06:56,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2018-11-23 00:06:56,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 00:06:56,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 14 transitions. [2018-11-23 00:06:56,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 00:06:56,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 00:06:56,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-23 00:06:56,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:06:56,160 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-23 00:06:56,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-23 00:06:56,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-11-23 00:06:56,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 00:06:56,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-23 00:06:56,176 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 00:06:56,176 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 00:06:56,176 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 00:06:56,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-23 00:06:56,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 00:06:56,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:06:56,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:06:56,177 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:06:56,177 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 00:06:56,177 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 149#L-1 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; 150#L385 assume !(main_~length~0 < 1); 154#L385-2 assume !(main_~n~0 < 1); 152#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(0, main_~nondetString~0.base, main_~nondetString~0.offset, 1);main_~nondetString~0.base, main_~nondetString~0.offset := main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset + (main_~n~0 - 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~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; 153#L370-2 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, cstrncpy_#t~post206.offset - 1;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, cstrncpy_#t~post207.offset - 1;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); 147#L372 assume 0 == cstrncpy_#t~mem208;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~mem208;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; 145#L375-3 [2018-11-23 00:06:56,177 INFO L796 eck$LassoCheckResult]: Loop: 145#L375-3 cstrncpy_#t~post209 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post209 - 1; 146#L375-1 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, cstrncpy_#t~post210.offset - 1;call write~int(0, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, 1);havoc cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset; 145#L375-3 [2018-11-23 00:06:56,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:06:56,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2018-11-23 00:06:56,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:06:56,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:06:56,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:06:56,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:06:56,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:06:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:06:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:06:56,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:06:56,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2018-11-23 00:06:56,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:06:56,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:06:56,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:06:56,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:06:56,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:06:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:06:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:06:56,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:06:56,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2018-11-23 00:06:56,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:06:56,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:06:56,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:06:56,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:06:56,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:06:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:06:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:06:56,595 WARN L180 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 128 [2018-11-23 00:06:56,682 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:06:56,682 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:06:56,682 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:06:56,682 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:06:56,682 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:06:56,682 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:06:56,682 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:06:56,682 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:06:56,682 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_reverse_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-23 00:06:56,683 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:06:56,683 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:06:56,686 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-23 00:06:56,687 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-23 00:06:56,688 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-23 00:06:56,913 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2018-11-23 00:06:56,960 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-23 00:06:56,961 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-23 00:06:56,962 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-23 00:06:56,963 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-23 00:06:56,964 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-23 00:06:56,965 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-23 00:06:56,966 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-23 00:06:56,967 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-23 00:06:56,968 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-23 00:06:56,973 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-23 00:06:56,974 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-23 00:06:56,975 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-23 00:06:56,976 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-23 00:06:56,977 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-23 00:06:56,977 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-23 00:06:56,979 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-23 00:06:57,283 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:06:57,283 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:06:57,284 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-23 00:06:57,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:06:57,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:06:57,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:06:57,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:06:57,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:06:57,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:06:57,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:06:57,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:06:57,286 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-23 00:06:57,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:06:57,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:06:57,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:06:57,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:06:57,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:06:57,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:06:57,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:06:57,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:06:57,288 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-23 00:06:57,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:06:57,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:06:57,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:06:57,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:06:57,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:06:57,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:06:57,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:06:57,291 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-23 00:06:57,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:06:57,291 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:06:57,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:06:57,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:06:57,293 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:06:57,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:06:57,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:06:57,303 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-23 00:06:57,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:06:57,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:06:57,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:06:57,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:06:57,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:06:57,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:06:57,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:06:57,306 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-23 00:06:57,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:06:57,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:06:57,307 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:06:57,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:06:57,315 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 00:06:57,315 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:06:57,376 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 00:06:57,426 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 00:06:57,426 INFO L444 ModelExtractionUtils]: 54 out of 66 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-11-23 00:06:57,426 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 00:06:57,428 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-23 00:06:57,428 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 00:06:57,428 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_2, ULTIMATE.start_cstrncpy_~us~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_2 + 2*ULTIMATE.start_cstrncpy_~us~0.offset Supporting invariants [] [2018-11-23 00:06:57,482 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-11-23 00:06:57,485 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 00:06:57,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:06:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:06:57,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:06:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:06:57,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:06:57,527 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-23 00:06:57,527 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2018-11-23 00:06:57,527 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-23 00:06:57,548 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 12 states and 16 transitions. Complement of second has 5 states. [2018-11-23 00:06:57,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 00:06:57,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 00:06:57,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-23 00:06:57,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-23 00:06:57,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:06:57,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-23 00:06:57,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:06:57,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-23 00:06:57,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:06:57,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2018-11-23 00:06:57,551 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 00:06:57,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2018-11-23 00:06:57,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 00:06:57,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 00:06:57,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 00:06:57,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:06:57,551 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:06:57,551 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:06:57,551 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:06:57,551 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 00:06:57,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 00:06:57,552 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 00:06:57,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 00:06:57,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 12:06:57 BoogieIcfgContainer [2018-11-23 00:06:57,555 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 00:06:57,556 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:06:57,556 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:06:57,556 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:06:57,556 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:06:54" (3/4) ... [2018-11-23 00:06:57,558 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 00:06:57,558 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:06:57,559 INFO L168 Benchmark]: Toolchain (without parser) took 3690.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.7 MB). Free memory was 957.6 MB in the beginning and 935.1 MB in the end (delta: 22.5 MB). Peak memory consumption was 210.2 MB. Max. memory is 11.5 GB. [2018-11-23 00:06:57,560 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:06:57,560 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -159.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2018-11-23 00:06:57,561 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.75 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:06:57,561 INFO L168 Benchmark]: Boogie Preprocessor took 17.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:06:57,562 INFO L168 Benchmark]: RCFGBuilder took 201.20 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:06:57,562 INFO L168 Benchmark]: BuchiAutomizer took 3054.04 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 935.1 MB in the end (delta: 159.1 MB). Peak memory consumption was 213.6 MB. Max. memory is 11.5 GB. [2018-11-23 00:06:57,563 INFO L168 Benchmark]: Witness Printer took 2.86 ms. Allocated memory is still 1.2 GB. Free memory is still 935.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:06:57,565 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 383.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -159.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.75 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 201.20 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3054.04 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 935.1 MB in the end (delta: 159.1 MB). Peak memory consumption was 213.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.86 ms. Allocated memory is still 1.2 GB. Free memory is still 935.1 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 2 * dst + 1 and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(n * sizeof(char))] + 2 * us and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. 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 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 25 SDtfs, 26 SDslu, 15 SDs, 0 SdLazy, 7 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital241 mio100 ax100 hnf99 lsp97 ukn88 mio100 lsp33 div100 bol100 ite100 ukn100 eq198 hnf89 smp100 dnf115 smp100 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 122ms VariablesStem: 12 VariablesLoop: 7 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...