./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c32cbbc7-7c3c-49c9-9e64-9953784442d3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c32cbbc7-7c3c-49c9-9e64-9953784442d3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c32cbbc7-7c3c-49c9-9e64-9953784442d3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c32cbbc7-7c3c-49c9-9e64-9953784442d3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c32cbbc7-7c3c-49c9-9e64-9953784442d3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c32cbbc7-7c3c-49c9-9e64-9953784442d3/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 32bit --witnessprinter.graph.data.programhash bd1b17fffb471392e4e5cb414f885f337c434a14 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:59:04,998 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:59:04,999 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:59:05,006 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:59:05,007 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:59:05,007 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:59:05,008 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:59:05,009 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:59:05,009 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:59:05,010 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:59:05,010 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:59:05,010 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:59:05,011 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:59:05,011 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:59:05,012 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:59:05,012 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:59:05,013 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:59:05,014 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:59:05,015 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:59:05,016 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:59:05,016 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:59:05,017 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:59:05,019 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:59:05,019 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:59:05,019 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:59:05,020 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:59:05,020 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:59:05,021 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:59:05,021 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:59:05,022 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:59:05,022 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:59:05,022 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:59:05,022 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:59:05,022 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:59:05,023 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:59:05,023 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:59:05,023 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c32cbbc7-7c3c-49c9-9e64-9953784442d3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 12:59:05,031 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:59:05,031 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:59:05,032 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:59:05,032 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:59:05,033 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:59:05,033 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:59:05,033 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:59:05,033 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:59:05,033 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:59:05,033 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:59:05,034 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:59:05,034 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:59:05,034 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:59:05,034 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:59:05,034 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:59:05,034 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:59:05,034 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:59:05,035 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:59:05,035 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:59:05,035 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:59:05,035 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:59:05,035 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:59:05,035 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:59:05,036 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:59:05,036 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:59:05,036 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:59:05,036 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:59:05,036 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:59:05,036 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:59:05,036 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:59:05,037 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:59:05,037 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:59:05,037 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_c32cbbc7-7c3c-49c9-9e64-9953784442d3/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd1b17fffb471392e4e5cb414f885f337c434a14 [2018-11-28 12:59:05,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:59:05,070 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:59:05,073 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:59:05,074 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:59:05,074 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:59:05,075 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c32cbbc7-7c3c-49c9-9e64-9953784442d3/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-11-28 12:59:05,117 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c32cbbc7-7c3c-49c9-9e64-9953784442d3/bin-2019/uautomizer/data/558c16a88/043d250921dc44ae9bc5ac08c5a5430a/FLAGec9d3d131 [2018-11-28 12:59:05,531 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:59:05,531 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c32cbbc7-7c3c-49c9-9e64-9953784442d3/sv-benchmarks/c/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-11-28 12:59:05,537 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c32cbbc7-7c3c-49c9-9e64-9953784442d3/bin-2019/uautomizer/data/558c16a88/043d250921dc44ae9bc5ac08c5a5430a/FLAGec9d3d131 [2018-11-28 12:59:05,545 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c32cbbc7-7c3c-49c9-9e64-9953784442d3/bin-2019/uautomizer/data/558c16a88/043d250921dc44ae9bc5ac08c5a5430a [2018-11-28 12:59:05,547 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:59:05,548 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:59:05,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:59:05,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:59:05,551 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:59:05,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:59:05" (1/1) ... [2018-11-28 12:59:05,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39239a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:05, skipping insertion in model container [2018-11-28 12:59:05,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:59:05" (1/1) ... [2018-11-28 12:59:05,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:59:05,581 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:59:05,757 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:59:05,766 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:59:05,835 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:59:05,858 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:59:05,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:05 WrapperNode [2018-11-28 12:59:05,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:59:05,859 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:59:05,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:59:05,859 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:59:05,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:05" (1/1) ... [2018-11-28 12:59:05,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:05" (1/1) ... [2018-11-28 12:59:05,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:59:05,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:59:05,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:59:05,890 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:59:05,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:05" (1/1) ... [2018-11-28 12:59:05,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:05" (1/1) ... [2018-11-28 12:59:05,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:05" (1/1) ... [2018-11-28 12:59:05,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:05" (1/1) ... [2018-11-28 12:59:05,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:05" (1/1) ... [2018-11-28 12:59:05,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:05" (1/1) ... [2018-11-28 12:59:05,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:05" (1/1) ... [2018-11-28 12:59:05,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:59:05,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:59:05,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:59:05,904 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:59:05,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c32cbbc7-7c3c-49c9-9e64-9953784442d3/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-28 12:59:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:59:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:59:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:59:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:59:05,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:59:05,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:59:06,123 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:59:06,123 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 12:59:06,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:59:06 BoogieIcfgContainer [2018-11-28 12:59:06,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:59:06,124 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:59:06,124 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:59:06,127 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:59:06,128 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:59:06,128 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:59:05" (1/3) ... [2018-11-28 12:59:06,129 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@acbb746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:59:06, skipping insertion in model container [2018-11-28 12:59:06,129 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:59:06,129 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:05" (2/3) ... [2018-11-28 12:59:06,130 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@acbb746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:59:06, skipping insertion in model container [2018-11-28 12:59:06,130 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:59:06,130 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:59:06" (3/3) ... [2018-11-28 12:59:06,131 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-11-28 12:59:06,177 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:59:06,177 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:59:06,177 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:59:06,178 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:59:06,178 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:59:06,178 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:59:06,178 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:59:06,178 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:59:06,178 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:59:06,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 12:59:06,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 12:59:06,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:59:06,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:59:06,211 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 12:59:06,211 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 12:59:06,211 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:59:06,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 12:59:06,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 12:59:06,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:59:06,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:59:06,213 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 12:59:06,213 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 12:59:06,220 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~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 7#L554true assume !(main_~length1~0 < 1); 12#L554-2true assume !(main_~length2~0 < 1); 6#L557-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 17#L543-5true [2018-11-28 12:59:06,220 INFO L796 eck$LassoCheckResult]: Loop: 17#L543-5true call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 10#L543-1true assume cstrcmp_#t~short5;call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; 13#L543-3true assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~short5;havoc cstrcmp_#t~mem2;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 17#L543-5true [2018-11-28 12:59:06,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:59:06,225 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-28 12:59:06,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:59:06,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:59:06,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:06,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:59:06,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:59:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:59:06,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:59:06,324 INFO L82 PathProgramCache]: Analyzing trace with hash 49755, now seen corresponding path program 1 times [2018-11-28 12:59:06,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:59:06,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:59:06,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:06,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:59:06,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:59:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:59:06,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:59:06,340 INFO L82 PathProgramCache]: Analyzing trace with hash 180429558, now seen corresponding path program 1 times [2018-11-28 12:59:06,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:59:06,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:59:06,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:06,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:59:06,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:59:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:59:06,529 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2018-11-28 12:59:06,717 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-11-28 12:59:06,783 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:59:06,784 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:59:06,784 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:59:06,784 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:59:06,784 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:59:06,784 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:59:06,784 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:59:06,785 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:59:06,785 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcmp-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-28 12:59:06,785 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:59:06,785 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:59:06,801 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-28 12:59:07,014 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2018-11-28 12:59:07,094 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-28 12:59:07,096 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-28 12:59:07,097 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-28 12:59:07,098 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-28 12:59:07,100 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-28 12:59:07,101 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-28 12:59:07,102 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-28 12:59:07,104 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-28 12:59:07,106 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-28 12:59:07,107 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-28 12:59:07,109 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-28 12:59:07,110 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-28 12:59:07,111 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-28 12:59:07,113 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-28 12:59:07,114 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-28 12:59:07,115 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-28 12:59:07,118 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-28 12:59:07,120 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-28 12:59:07,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-28 12:59:07,123 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-28 12:59:07,433 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:59:07,437 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:59:07,439 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-28 12:59:07,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:59:07,441 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:59:07,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:59:07,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:59:07,446 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:59:07,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:59:07,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:59:07,463 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-28 12:59:07,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:59:07,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:59:07,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:59:07,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:59:07,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:59:07,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:59:07,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:59:07,476 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-28 12:59:07,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:59:07,477 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:59:07,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:59:07,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:59:07,481 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:59:07,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:59:07,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:59:07,494 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-28 12:59:07,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:59:07,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:59:07,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:59:07,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:59:07,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:59:07,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:59:07,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:59:07,500 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-28 12:59:07,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:59:07,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:59:07,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:59:07,501 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:59:07,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:59:07,501 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:59:07,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:59:07,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:59:07,505 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-28 12:59:07,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:59:07,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:59:07,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:59:07,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:59:07,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:59:07,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:59:07,564 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:59:07,605 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-28 12:59:07,605 INFO L444 ModelExtractionUtils]: 36 out of 46 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-28 12:59:07,607 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:59:07,609 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:59:07,609 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:59:07,610 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_1, ULTIMATE.start_cstrcmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_1 - 1*ULTIMATE.start_cstrcmp_~s1.offset Supporting invariants [] [2018-11-28 12:59:07,675 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2018-11-28 12:59:07,682 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 12:59:07,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:59:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:59:07,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:59:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:59:07,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:59:07,746 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-28 12:59:07,756 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-28 12:59:07,757 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 4 states. [2018-11-28 12:59:07,812 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 4 states. Result 36 states and 49 transitions. Complement of second has 8 states. [2018-11-28 12:59:07,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:59:07,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 12:59:07,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-11-28 12:59:07,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-28 12:59:07,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:59:07,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-28 12:59:07,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:59:07,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-28 12:59:07,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:59:07,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 49 transitions. [2018-11-28 12:59:07,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 12:59:07,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 15 states and 20 transitions. [2018-11-28 12:59:07,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 12:59:07,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 12:59:07,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2018-11-28 12:59:07,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:59:07,822 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 12:59:07,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2018-11-28 12:59:07,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-11-28 12:59:07,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 12:59:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-11-28 12:59:07,839 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-28 12:59:07,840 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-28 12:59:07,840 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:59:07,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2018-11-28 12:59:07,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 12:59:07,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:59:07,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:59:07,840 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:59:07,841 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 12:59:07,841 INFO L794 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 172#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 173#L554 assume !(main_~length1~0 < 1); 180#L554-2 assume !(main_~length2~0 < 1); 181#L557-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 184#L543-5 call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 174#L543-1 [2018-11-28 12:59:07,841 INFO L796 eck$LassoCheckResult]: Loop: 174#L543-1 assume !cstrcmp_#t~short5; 175#L543-3 assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~short5;havoc cstrcmp_#t~mem2;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 182#L543-5 call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 174#L543-1 [2018-11-28 12:59:07,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:59:07,841 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2018-11-28 12:59:07,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:59:07,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:59:07,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:07,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:59:07,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:59:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:59:07,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:59:07,859 INFO L82 PathProgramCache]: Analyzing trace with hash 54797, now seen corresponding path program 1 times [2018-11-28 12:59:07,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:59:07,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:59:07,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:07,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:59:07,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:59:07,903 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-28 12:59:07,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:59:07,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:59:07,907 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:59:07,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:59:07,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:59:07,910 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 12:59:07,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:59:07,924 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2018-11-28 12:59:07,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:59:07,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. [2018-11-28 12:59:07,925 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:59:07,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2018-11-28 12:59:07,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 12:59:07,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 12:59:07,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 12:59:07,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:59:07,926 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:59:07,926 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:59:07,926 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:59:07,926 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:59:07,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:59:07,927 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:59:07,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 12:59:07,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 12:59:07 BoogieIcfgContainer [2018-11-28 12:59:07,932 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 12:59:07,932 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:59:07,932 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:59:07,932 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:59:07,932 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:59:06" (3/4) ... [2018-11-28 12:59:07,935 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 12:59:07,935 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:59:07,936 INFO L168 Benchmark]: Toolchain (without parser) took 2388.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 950.6 MB in the beginning and 1.0 GB in the end (delta: -64.1 MB). Peak memory consumption was 82.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:59:07,937 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:59:07,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:59:07,938 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.95 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-28 12:59:07,938 INFO L168 Benchmark]: Boogie Preprocessor took 14.82 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-28 12:59:07,939 INFO L168 Benchmark]: RCFGBuilder took 219.18 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:59:07,939 INFO L168 Benchmark]: BuchiAutomizer took 1807.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 93.7 MB). Peak memory consumption was 93.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:59:07,940 INFO L168 Benchmark]: Witness Printer took 3.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:59:07,943 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 310.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.95 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 14.82 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 219.18 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1807.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 93.7 MB). Peak memory consumption was 93.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s1 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. 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 1. 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 14 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 23 SDtfs, 21 SDslu, 13 SDs, 0 SdLazy, 17 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital208 mio100 ax100 hnf99 lsp97 ukn85 mio100 lsp47 div100 bol100 ite100 ukn100 eq195 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 4 VariablesLoop: 4 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...