./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_strlen_malloc_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_265153c3-fdaf-4619-925c-2abe6f33b9e4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_265153c3-fdaf-4619-925c-2abe6f33b9e4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_265153c3-fdaf-4619-925c-2abe6f33b9e4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_265153c3-fdaf-4619-925c-2abe6f33b9e4/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_strlen_malloc_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_265153c3-fdaf-4619-925c-2abe6f33b9e4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_265153c3-fdaf-4619-925c-2abe6f33b9e4/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 03de162ccadd41d16dfce723d629801bfe048af4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:06:39,520 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:06:39,522 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:06:39,530 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:06:39,530 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:06:39,531 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:06:39,532 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:06:39,533 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:06:39,534 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:06:39,535 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:06:39,535 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:06:39,536 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:06:39,536 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:06:39,537 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:06:39,538 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:06:39,538 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:06:39,539 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:06:39,540 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:06:39,541 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:06:39,543 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:06:39,543 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:06:39,544 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:06:39,546 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:06:39,546 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:06:39,546 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:06:39,547 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:06:39,547 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:06:39,548 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:06:39,549 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:06:39,549 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:06:39,549 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:06:39,550 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:06:39,550 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:06:39,550 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:06:39,551 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:06:39,551 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:06:39,552 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_265153c3-fdaf-4619-925c-2abe6f33b9e4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 07:06:39,562 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:06:39,562 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:06:39,563 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:06:39,564 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:06:39,564 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:06:39,564 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:06:39,564 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:06:39,564 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:06:39,564 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:06:39,565 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:06:39,565 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:06:39,565 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:06:39,565 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:06:39,565 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:06:39,565 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:06:39,565 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:06:39,566 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:06:39,566 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:06:39,566 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:06:39,566 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:06:39,566 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:06:39,566 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:06:39,566 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:06:39,567 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:06:39,567 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:06:39,567 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:06:39,567 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:06:39,568 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:06:39,568 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_265153c3-fdaf-4619-925c-2abe6f33b9e4/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 -> 03de162ccadd41d16dfce723d629801bfe048af4 [2018-11-10 07:06:39,592 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:06:39,600 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:06:39,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:06:39,603 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:06:39,603 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:06:39,604 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_265153c3-fdaf-4619-925c-2abe6f33b9e4/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_strlen_malloc_true-termination.c.i [2018-11-10 07:06:39,637 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_265153c3-fdaf-4619-925c-2abe6f33b9e4/bin-2019/uautomizer/data/73830855f/47d482785e9e445b9776602ee34eeec9/FLAG533e03eb6 [2018-11-10 07:06:40,030 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:06:40,031 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_265153c3-fdaf-4619-925c-2abe6f33b9e4/sv-benchmarks/c/termination-recursive-malloc/rec_strlen_malloc_true-termination.c.i [2018-11-10 07:06:40,035 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_265153c3-fdaf-4619-925c-2abe6f33b9e4/bin-2019/uautomizer/data/73830855f/47d482785e9e445b9776602ee34eeec9/FLAG533e03eb6 [2018-11-10 07:06:40,043 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_265153c3-fdaf-4619-925c-2abe6f33b9e4/bin-2019/uautomizer/data/73830855f/47d482785e9e445b9776602ee34eeec9 [2018-11-10 07:06:40,045 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:06:40,046 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:06:40,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:06:40,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:06:40,048 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:06:40,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:06:40" (1/1) ... [2018-11-10 07:06:40,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79444f43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:40, skipping insertion in model container [2018-11-10 07:06:40,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:06:40" (1/1) ... [2018-11-10 07:06:40,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:06:40,067 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:06:40,164 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:06:40,170 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:06:40,179 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:06:40,189 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:06:40,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:40 WrapperNode [2018-11-10 07:06:40,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:06:40,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:06:40,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:06:40,190 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:06:40,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:40" (1/1) ... [2018-11-10 07:06:40,204 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:40" (1/1) ... [2018-11-10 07:06:40,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:06:40,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:06:40,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:06:40,219 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:06:40,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:40" (1/1) ... [2018-11-10 07:06:40,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:40" (1/1) ... [2018-11-10 07:06:40,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:40" (1/1) ... [2018-11-10 07:06:40,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:40" (1/1) ... [2018-11-10 07:06:40,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:40" (1/1) ... [2018-11-10 07:06:40,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:40" (1/1) ... [2018-11-10 07:06:40,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:40" (1/1) ... [2018-11-10 07:06:40,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:06:40,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:06:40,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:06:40,234 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:06:40,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_265153c3-fdaf-4619-925c-2abe6f33b9e4/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-10 07:06:40,322 INFO L130 BoogieDeclarations]: Found specification of procedure rec_cstrlen [2018-11-10 07:06:40,322 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_cstrlen [2018-11-10 07:06:40,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 07:06:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:06:40,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:06:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 07:06:40,432 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:06:40,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:06:40 BoogieIcfgContainer [2018-11-10 07:06:40,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:06:40,433 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:06:40,433 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:06:40,437 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:06:40,438 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:06:40,438 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:06:40" (1/3) ... [2018-11-10 07:06:40,439 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@156205c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:06:40, skipping insertion in model container [2018-11-10 07:06:40,439 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:06:40,439 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:40" (2/3) ... [2018-11-10 07:06:40,439 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@156205c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:06:40, skipping insertion in model container [2018-11-10 07:06:40,440 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:06:40,440 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:06:40" (3/3) ... [2018-11-10 07:06:40,441 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_strlen_malloc_true-termination.c.i [2018-11-10 07:06:40,490 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:06:40,490 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:06:40,491 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:06:40,491 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:06:40,491 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:06:40,491 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:06:40,491 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:06:40,491 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:06:40,491 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:06:40,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-10 07:06:40,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 07:06:40,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:06:40,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:06:40,533 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:06:40,534 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 07:06:40,534 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:06:40,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-10 07:06:40,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 07:06:40,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:06:40,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:06:40,535 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:06:40,536 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 07:06:40,541 INFO L793 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret5.base, main_#t~ret5.offset, main_#t~ret6;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet1, build_nondet_String_#t~malloc2.base, build_nondet_String_#t~malloc2.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet1;havoc build_nondet_String_#t~nondet1; 14#L11true assume !(build_nondet_String_~length~0 < 1); 10#L11-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc2.base, build_nondet_String_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc2.base, build_nondet_String_#t~malloc2.offset; 3#L15true SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L15 19#L15-1true build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 4#L16true main_#t~ret5.base, main_#t~ret5.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true; 9#L30true call main_#t~ret6 := rec_cstrlen(main_#t~ret5.base, main_#t~ret5.offset);< 5#rec_cstrlenENTRYtrue [2018-11-10 07:06:40,541 INFO L795 eck$LassoCheckResult]: Loop: 5#rec_cstrlenENTRYtrue ~s.base, ~s.offset := #in~s.base, #in~s.offset; 16#L22true SUMMARY for call #t~mem3 := read~int(~s.base, ~s.offset, 1); srcloc: L22 12#L22-1true assume !(#t~mem3 == 0);havoc #t~mem3; 21#L25true call #t~ret4 := rec_cstrlen(~s.base, ~s.offset + 1);< 5#rec_cstrlenENTRYtrue [2018-11-10 07:06:40,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:06:40,546 INFO L82 PathProgramCache]: Analyzing trace with hash 176577557, now seen corresponding path program 1 times [2018-11-10 07:06:40,547 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:06:40,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:06:40,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:06:40,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:06:40,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:06:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:06:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:06:40,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:06:40,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1509544, now seen corresponding path program 1 times [2018-11-10 07:06:40,642 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:06:40,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:06:40,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:06:40,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:06:40,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:06:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:06:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:06:40,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:06:40,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1764309692, now seen corresponding path program 1 times [2018-11-10 07:06:40,652 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:06:40,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:06:40,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:06:40,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:06:40,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:06:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:06:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:06:40,946 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2018-11-10 07:06:41,101 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:06:41,102 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:06:41,102 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:06:41,102 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:06:41,102 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:06:41,102 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:06:41,103 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:06:41,103 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:06:41,103 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_strlen_malloc_true-termination.c.i_Iteration1_Lasso [2018-11-10 07:06:41,103 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:06:41,103 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:06:41,121 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-10 07:06:41,126 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-10 07:06:41,128 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-10 07:06:41,130 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-10 07:06:41,146 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-10 07:06:41,148 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-10 07:06:41,152 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-10 07:06:41,154 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-10 07:06:41,156 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-10 07:06:41,158 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-10 07:06:41,162 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-10 07:06:41,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-10 07:06:41,207 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-10 07:06:41,209 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-10 07:06:41,210 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-10 07:06:41,212 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-10 07:06:41,213 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-10 07:06:41,214 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-10 07:06:41,216 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-10 07:06:41,217 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-10 07:06:41,219 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-10 07:06:41,221 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-10 07:06:41,223 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-10 07:06:41,226 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-10 07:06:41,228 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-10 07:06:41,230 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-10 07:06:41,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-10 07:06:41,234 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-10 07:06:41,250 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-10 07:06:41,252 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-10 07:06:41,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:06:41,374 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:06:41,377 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:06:41,379 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-10 07:06:41,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:41,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:06:41,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:41,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:41,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:41,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:06:41,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:06:41,385 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:41,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-10 07:06:41,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:41,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:06:41,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:41,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:41,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:41,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:06:41,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:06:41,388 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:41,388 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-10 07:06:41,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:41,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:06:41,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:41,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:41,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:41,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:06:41,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:06:41,391 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:41,391 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-10 07:06:41,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:41,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:06:41,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:41,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:41,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:41,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:06:41,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:06:41,394 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:41,395 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-10 07:06:41,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:41,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:41,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:41,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:41,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:06:41,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:41,403 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:41,404 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-10 07:06:41,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:41,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:06:41,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:41,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:41,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:41,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:06:41,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:06:41,406 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:41,407 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-10 07:06:41,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:41,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:06:41,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:41,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:41,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:41,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:06:41,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:06:41,409 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:41,409 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-10 07:06:41,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:41,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:06:41,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:41,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:41,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:41,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:06:41,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:06:41,412 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:41,412 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-10 07:06:41,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:41,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:06:41,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:41,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:41,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:41,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:06:41,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:06:41,415 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:41,415 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-10 07:06:41,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:41,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:06:41,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:41,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:41,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:41,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:06:41,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:06:41,418 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:41,418 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-10 07:06:41,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:41,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:06:41,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:41,419 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 07:06:41,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:41,420 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:06:41,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:06:41,423 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:41,423 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-10 07:06:41,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:41,424 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:06:41,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:41,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:41,425 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:06:41,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:41,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:41,434 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-10 07:06:41,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:41,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:41,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:41,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:41,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:06:41,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:41,446 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:41,447 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-10 07:06:41,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:41,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:41,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:41,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:41,449 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:06:41,449 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:41,452 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:06:41,452 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-10 07:06:41,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:06:41,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:06:41,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:06:41,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:06:41,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:06:41,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:06:41,480 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:06:41,499 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 07:06:41,499 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 07:06:41,501 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:06:41,502 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:06:41,503 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:06:41,503 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length rec_cstrlen_#in~s.base)_1, rec_cstrlen_#in~s.offset) = 1*v_rep(select #length rec_cstrlen_#in~s.base)_1 - 1*rec_cstrlen_#in~s.offset Supporting invariants [] [2018-11-10 07:06:41,507 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-10 07:06:41,516 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 07:06:41,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:06:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:41,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:06:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:41,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:06:41,594 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-10 07:06:41,604 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 07:06:41,605 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 4 states. [2018-11-10 07:06:41,671 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 4 states. Result 37 states and 42 transitions. Complement of second has 12 states. [2018-11-10 07:06:41,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:06:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 07:06:41,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-10 07:06:41,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-10 07:06:41,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:06:41,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 4 letters. [2018-11-10 07:06:41,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:06:41,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 8 letters. [2018-11-10 07:06:41,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:06:41,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2018-11-10 07:06:41,680 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:06:41,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2018-11-10 07:06:41,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 07:06:41,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 07:06:41,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 07:06:41,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:06:41,683 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:06:41,683 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:06:41,683 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:06:41,683 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:06:41,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:06:41,683 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:06:41,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 07:06:41,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:06:41 BoogieIcfgContainer [2018-11-10 07:06:41,688 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:06:41,688 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:06:41,689 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:06:41,689 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:06:41,689 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:06:40" (3/4) ... [2018-11-10 07:06:41,692 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 07:06:41,692 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:06:41,693 INFO L168 Benchmark]: Toolchain (without parser) took 1647.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 954.8 MB in the beginning and 969.9 MB in the end (delta: -15.0 MB). Peak memory consumption was 147.0 MB. Max. memory is 11.5 GB. [2018-11-10 07:06:41,694 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:06:41,694 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.93 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:06:41,695 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.59 ms. Allocated memory is still 1.0 GB. Free memory was 944.1 MB in the beginning and 941.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:06:41,696 INFO L168 Benchmark]: Boogie Preprocessor took 14.76 ms. Allocated memory is still 1.0 GB. Free memory is still 941.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:06:41,696 INFO L168 Benchmark]: RCFGBuilder took 198.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -203.9 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:06:41,697 INFO L168 Benchmark]: BuchiAutomizer took 1254.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 969.9 MB in the end (delta: 172.1 MB). Peak memory consumption was 172.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:06:41,697 INFO L168 Benchmark]: Witness Printer took 3.89 ms. Allocated memory is still 1.2 GB. Free memory is still 969.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:06:41,700 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 142.93 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.59 ms. Allocated memory is still 1.0 GB. Free memory was 944.1 MB in the beginning and 941.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.76 ms. Allocated memory is still 1.0 GB. Free memory is still 941.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 198.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -203.9 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1254.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 969.9 MB in the end (delta: 172.1 MB). Peak memory consumption was 172.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.89 ms. Allocated memory is still 1.2 GB. Free memory is still 969.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.2s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13 SDtfs, 20 SDslu, 3 SDs, 0 SdLazy, 13 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital88 mio100 ax100 hnf100 lsp93 ukn63 mio100 lsp55 div100 bol100 ite100 ukn100 eq162 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...