./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrlen-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ec1d2865-b7bb-4123-9610-ddae902b5d69/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ec1d2865-b7bb-4123-9610-ddae902b5d69/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ec1d2865-b7bb-4123-9610-ddae902b5d69/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ec1d2865-b7bb-4123-9610-ddae902b5d69/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrlen-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ec1d2865-b7bb-4123-9610-ddae902b5d69/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ec1d2865-b7bb-4123-9610-ddae902b5d69/bin/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 b812e7d14425eea3a24125f5e2db40eadfc6c14c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:01:31,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:31,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:31,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:31,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:31,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:31,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:31,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:31,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:31,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:31,043 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:31,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:31,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:31,045 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:31,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:31,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:31,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:31,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:31,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:31,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:31,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:31,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:31,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:31,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:31,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:31,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:31,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:31,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:31,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:31,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:31,071 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:31,072 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:31,073 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:31,073 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:31,074 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:31,075 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:31,075 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:31,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:31,076 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:31,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:31,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:31,078 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ec1d2865-b7bb-4123-9610-ddae902b5d69/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:01:31,097 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:31,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:31,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:31,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:31,098 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:31,099 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:01:31,099 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:01:31,099 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:01:31,099 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:01:31,099 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:01:31,099 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:01:31,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:31,100 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:01:31,100 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:01:31,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:31,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:01:31,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:31,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:01:31,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:01:31,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:01:31,101 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:01:31,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:31,101 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:01:31,102 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:31,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:01:31,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:31,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:31,102 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:01:31,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:31,103 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:31,103 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:01:31,103 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:01:31,104 INFO L138 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_ec1d2865-b7bb-4123-9610-ddae902b5d69/bin/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 -> b812e7d14425eea3a24125f5e2db40eadfc6c14c [2019-10-22 09:01:31,129 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:31,140 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:31,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:31,145 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:31,145 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:31,146 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ec1d2865-b7bb-4123-9610-ddae902b5d69/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrlen-alloca-1.i [2019-10-22 09:01:31,202 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec1d2865-b7bb-4123-9610-ddae902b5d69/bin/uautomizer/data/eade5ca8c/506dc46a812c45338ad1e0218f4d0e27/FLAG7b540052e [2019-10-22 09:01:31,635 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:31,635 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ec1d2865-b7bb-4123-9610-ddae902b5d69/sv-benchmarks/c/array-memsafety/openbsd_cstrlen-alloca-1.i [2019-10-22 09:01:31,650 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec1d2865-b7bb-4123-9610-ddae902b5d69/bin/uautomizer/data/eade5ca8c/506dc46a812c45338ad1e0218f4d0e27/FLAG7b540052e [2019-10-22 09:01:31,974 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ec1d2865-b7bb-4123-9610-ddae902b5d69/bin/uautomizer/data/eade5ca8c/506dc46a812c45338ad1e0218f4d0e27 [2019-10-22 09:01:31,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:31,976 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:31,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:31,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:31,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:31,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:31" (1/1) ... [2019-10-22 09:01:31,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1715339f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:31, skipping insertion in model container [2019-10-22 09:01:31,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:31" (1/1) ... [2019-10-22 09:01:31,991 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:32,026 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:32,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:32,378 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:32,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:32,457 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:32,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:32 WrapperNode [2019-10-22 09:01:32,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:32,459 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:32,459 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:32,459 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:32,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:32" (1/1) ... [2019-10-22 09:01:32,480 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:32" (1/1) ... [2019-10-22 09:01:32,498 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:32,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:32,499 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:32,499 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:32,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:32" (1/1) ... [2019-10-22 09:01:32,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:32" (1/1) ... [2019-10-22 09:01:32,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:32" (1/1) ... [2019-10-22 09:01:32,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:32" (1/1) ... [2019-10-22 09:01:32,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:32" (1/1) ... [2019-10-22 09:01:32,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:32" (1/1) ... [2019-10-22 09:01:32,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:32" (1/1) ... [2019-10-22 09:01:32,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:32,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:32,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:32,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:32,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec1d2865-b7bb-4123-9610-ddae902b5d69/bin/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 [2019-10-22 09:01:32,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:01:32,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:01:32,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:01:32,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:01:32,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:32,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:32,745 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:32,746 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 09:01:32,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:32 BoogieIcfgContainer [2019-10-22 09:01:32,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:32,747 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:01:32,748 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:01:32,751 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:01:32,752 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:32,752 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:01:31" (1/3) ... [2019-10-22 09:01:32,753 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@dbacde2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:32, skipping insertion in model container [2019-10-22 09:01:32,753 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:32,753 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:32" (2/3) ... [2019-10-22 09:01:32,753 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@dbacde2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:32, skipping insertion in model container [2019-10-22 09:01:32,753 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:32,753 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:32" (3/3) ... [2019-10-22 09:01:32,755 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrlen-alloca-1.i [2019-10-22 09:01:32,796 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:01:32,797 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:01:32,797 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:01:32,797 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:32,797 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:32,797 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:01:32,797 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:32,797 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:01:32,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 09:01:32,830 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 09:01:32,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:32,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:32,837 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 09:01:32,837 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:01:32,837 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:01:32,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 09:01:32,839 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 09:01:32,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:32,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:32,839 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 09:01:32,839 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:01:32,846 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet7, main_#t~post6, main_~i~0, main_#t~ret8, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet4;havoc main_#t~nondet4; 7#L524true assume !(main_~length1~0 < 1); 11#L524-2true call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;main_~i~0 := 0; 5#L528-3true [2019-10-22 09:01:32,847 INFO L793 eck$LassoCheckResult]: Loop: 5#L528-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet7, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet7; 3#L528-2true main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 5#L528-3true [2019-10-22 09:01:32,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:32,853 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-10-22 09:01:32,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:32,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375109707] [2019-10-22 09:01:32,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:33,005 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:33,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:33,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-10-22 09:01:33,007 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:33,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097806709] [2019-10-22 09:01:33,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:33,033 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:33,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:33,037 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-10-22 09:01:33,038 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:33,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900281446] [2019-10-22 09:01:33,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:33,091 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:33,254 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:33,255 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:33,255 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:33,255 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:33,255 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:33,255 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:33,255 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:33,255 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:33,256 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlen-alloca-1.i_Iteration1_Lasso [2019-10-22 09:01:33,256 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:33,256 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:33,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:33,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:33,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:33,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:33,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:33,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:33,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:33,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:33,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:33,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:33,615 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:33,620 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:33,622 INFO L120 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 [2019-10-22 09:01:33,623 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:33,623 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:33,624 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:33,624 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:33,624 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:33,625 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:33,625 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:33,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:33,628 INFO L120 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 [2019-10-22 09:01:33,628 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:33,629 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:33,629 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:33,629 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:33,629 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:33,630 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:33,630 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:33,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:33,637 INFO L120 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 [2019-10-22 09:01:33,639 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:33,639 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:33,639 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:33,640 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:33,640 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:33,640 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:33,640 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:33,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:33,642 INFO L120 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 [2019-10-22 09:01:33,642 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:33,643 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:33,643 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:33,643 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:33,648 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:33,650 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:33,654 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:33,654 INFO L120 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 [2019-10-22 09:01:33,655 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:33,655 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:33,655 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:33,656 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:33,659 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:33,661 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:33,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:33,677 INFO L120 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 [2019-10-22 09:01:33,677 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:33,678 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:33,678 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:33,678 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:33,679 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:33,679 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:33,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:33,692 INFO L120 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 [2019-10-22 09:01:33,693 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:33,694 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:33,694 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:33,694 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:33,694 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:33,694 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:33,694 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:33,696 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:33,697 INFO L120 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 [2019-10-22 09:01:33,697 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:33,698 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:33,698 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:33,698 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:33,702 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:33,702 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:33,803 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:33,838 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-10-22 09:01:33,839 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 09:01:33,841 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:33,842 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:01:33,843 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:33,843 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1) = -1*ULTIMATE.start_main_~nondetString1~0.offset - 1*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1 Supporting invariants [] [2019-10-22 09:01:33,853 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 09:01:33,861 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:01:33,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:33,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:33,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:33,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:33,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:33,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:33,948 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 [2019-10-22 09:01:33,949 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-10-22 09:01:34,008 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 45 transitions. Complement of second has 7 states. [2019-10-22 09:01:34,010 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 [2019-10-22 09:01:34,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:01:34,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2019-10-22 09:01:34,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 09:01:34,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:34,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 09:01:34,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:34,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 4 letters. Loop has 4 letters. [2019-10-22 09:01:34,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:34,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2019-10-22 09:01:34,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:01:34,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 11 states and 14 transitions. [2019-10-22 09:01:34,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 09:01:34,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 09:01:34,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-10-22 09:01:34,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:34,031 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-10-22 09:01:34,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-10-22 09:01:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-10-22 09:01:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 09:01:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-10-22 09:01:34,054 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-10-22 09:01:34,055 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-10-22 09:01:34,055 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:01:34,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-10-22 09:01:34,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:01:34,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:34,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:34,056 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:01:34,056 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:01:34,056 INFO L791 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 107#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet7, main_#t~post6, main_~i~0, main_#t~ret8, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet4;havoc main_#t~nondet4; 108#L524 assume !(main_~length1~0 < 1); 117#L524-2 call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;main_~i~0 := 0; 114#L528-3 assume !(main_~i~0 < main_~length1~0 - 1); 115#L528-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);cstrlen_#in~str.base, cstrlen_#in~str.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 113#L518-4 [2019-10-22 09:01:34,057 INFO L793 eck$LassoCheckResult]: Loop: 113#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 116#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 112#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 113#L518-4 [2019-10-22 09:01:34,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:34,057 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-10-22 09:01:34,057 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:34,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273833067] [2019-10-22 09:01:34,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:34,077 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:34,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:34,077 INFO L82 PathProgramCache]: Analyzing trace with hash 56764, now seen corresponding path program 1 times [2019-10-22 09:01:34,077 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:34,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027502274] [2019-10-22 09:01:34,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:34,085 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:34,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:34,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1183925680, now seen corresponding path program 1 times [2019-10-22 09:01:34,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:34,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860612685] [2019-10-22 09:01:34,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:34,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860612685] [2019-10-22 09:01:34,203 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:34,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:01:34,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010319109] [2019-10-22 09:01:34,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:34,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:01:34,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:01:34,245 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-10-22 09:01:34,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:34,319 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-10-22 09:01:34,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:01:34,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-10-22 09:01:34,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:01:34,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 12 states and 14 transitions. [2019-10-22 09:01:34,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 09:01:34,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 09:01:34,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2019-10-22 09:01:34,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:34,322 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-10-22 09:01:34,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2019-10-22 09:01:34,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-10-22 09:01:34,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 09:01:34,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-10-22 09:01:34,324 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-10-22 09:01:34,324 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-10-22 09:01:34,324 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:01:34,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2019-10-22 09:01:34,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:01:34,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:34,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:34,328 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:34,328 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:01:34,328 INFO L791 eck$LassoCheckResult]: Stem: 153#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 149#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet7, main_#t~post6, main_~i~0, main_#t~ret8, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet4;havoc main_#t~nondet4; 150#L524 assume !(main_~length1~0 < 1); 159#L524-2 call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;main_~i~0 := 0; 156#L528-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet7, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet7; 151#L528-2 main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 152#L528-3 assume !(main_~i~0 < main_~length1~0 - 1); 157#L528-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);cstrlen_#in~str.base, cstrlen_#in~str.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 155#L518-4 [2019-10-22 09:01:34,329 INFO L793 eck$LassoCheckResult]: Loop: 155#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 158#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 154#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 155#L518-4 [2019-10-22 09:01:34,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:34,329 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-10-22 09:01:34,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:34,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748544305] [2019-10-22 09:01:34,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:34,362 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:34,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:34,364 INFO L82 PathProgramCache]: Analyzing trace with hash 56764, now seen corresponding path program 2 times [2019-10-22 09:01:34,365 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:34,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64112471] [2019-10-22 09:01:34,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:34,376 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:34,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:34,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1235379726, now seen corresponding path program 1 times [2019-10-22 09:01:34,377 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:34,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568989700] [2019-10-22 09:01:34,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:34,433 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:34,689 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-10-22 09:01:34,762 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:34,763 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:34,763 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:34,763 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:34,763 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:34,763 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:34,763 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:34,763 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:34,763 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlen-alloca-1.i_Iteration3_Lasso [2019-10-22 09:01:34,764 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:34,764 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:34,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:34,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:34,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:34,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:34,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:34,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:34,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:34,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:34,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:34,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:34,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:34,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:34,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:34,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:34,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:34,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:35,239 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:35,239 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:35,239 INFO L120 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 [2019-10-22 09:01:35,240 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:35,240 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:35,241 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:35,241 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:35,241 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:35,241 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:35,241 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:35,242 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:35,242 INFO L120 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 [2019-10-22 09:01:35,243 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:35,243 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:35,243 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:35,243 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:35,243 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:35,244 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:35,244 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:35,244 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:35,245 INFO L120 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 [2019-10-22 09:01:35,245 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:35,246 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:35,246 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:35,246 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:35,246 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:35,246 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:35,246 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:35,247 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:35,247 INFO L120 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 [2019-10-22 09:01:35,248 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:35,248 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:35,248 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:35,248 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:35,248 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:35,249 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:35,249 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:35,249 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:35,250 INFO L120 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 [2019-10-22 09:01:35,250 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:35,250 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:35,251 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:35,251 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:35,252 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:35,252 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:35,254 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:35,254 INFO L120 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 [2019-10-22 09:01:35,255 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:35,255 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:35,255 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:35,255 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:35,259 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:35,259 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:35,303 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:35,351 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:01:35,352 INFO L444 ModelExtractionUtils]: 27 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:01:35,355 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:35,356 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:01:35,356 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:35,356 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlen_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrlen_~s~0.base)_1) = -1*ULTIMATE.start_cstrlen_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrlen_~s~0.base)_1 Supporting invariants [] [2019-10-22 09:01:35,371 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-10-22 09:01:35,372 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:01:35,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:35,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:35,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:35,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:01:35,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:35,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:35,430 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 [2019-10-22 09:01:35,430 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-10-22 09:01:35,442 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 14 states and 17 transitions. Complement of second has 4 states. [2019-10-22 09:01:35,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:35,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:01:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-10-22 09:01:35,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2019-10-22 09:01:35,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:35,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 11 letters. Loop has 3 letters. [2019-10-22 09:01:35,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:35,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 8 letters. Loop has 6 letters. [2019-10-22 09:01:35,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:35,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-10-22 09:01:35,445 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:01:35,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2019-10-22 09:01:35,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:01:35,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:01:35,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:01:35,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:35,446 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:35,446 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:35,446 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:35,446 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:01:35,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:01:35,446 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:01:35,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:01:35,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:01:35 BoogieIcfgContainer [2019-10-22 09:01:35,454 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:01:35,454 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:35,454 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:35,454 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:35,455 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:32" (3/4) ... [2019-10-22 09:01:35,458 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:01:35,459 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:35,461 INFO L168 Benchmark]: Toolchain (without parser) took 3483.85 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 223.3 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -205.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:35,462 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:35,463 INFO L168 Benchmark]: CACSL2BoogieTranslator took 481.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:35,463 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.50 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. [2019-10-22 09:01:35,464 INFO L168 Benchmark]: Boogie Preprocessor took 23.21 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. [2019-10-22 09:01:35,465 INFO L168 Benchmark]: RCFGBuilder took 225.06 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: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:35,465 INFO L168 Benchmark]: BuchiAutomizer took 2706.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -37.3 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:35,467 INFO L168 Benchmark]: Witness Printer took 4.96 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:35,469 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 481.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.50 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. * Boogie Preprocessor took 23.21 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 225.06 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: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2706.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -37.3 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.96 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * nondetString1 + -1 * i + unknown-#length-unknown[nondetString1] and consists of 5 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 28 SDtfs, 44 SDslu, 29 SDs, 0 SdLazy, 44 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital113 mio100 ax116 hnf99 lsp80 ukn86 mio100 lsp58 div100 bol100 ite100 ukn100 eq171 hnf90 smp96 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...