./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/run_dir_22ec8ab6-1634-4c90-930b-a2a5132a8cb8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_22ec8ab6-1634-4c90-930b-a2a5132a8cb8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_22ec8ab6-1634-4c90-930b-a2a5132a8cb8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_22ec8ab6-1634-4c90-930b-a2a5132a8cb8/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrlen-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_22ec8ab6-1634-4c90-930b-a2a5132a8cb8/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_22ec8ab6-1634-4c90-930b-a2a5132a8cb8/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-11-15 22:31:45,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:31:45,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:31:45,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:31:45,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:31:45,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:31:45,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:31:45,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:31:45,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:31:45,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:31:45,601 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:31:45,603 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:31:45,603 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:31:45,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:31:45,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:31:45,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:31:45,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:31:45,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:31:45,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:31:45,614 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:31:45,617 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:31:45,618 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:31:45,621 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:31:45,621 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:31:45,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:31:45,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:31:45,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:31:45,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:31:45,626 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:31:45,626 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:31:45,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:31:45,627 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:31:45,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:31:45,628 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:31:45,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:31:45,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:31:45,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:31:45,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:31:45,631 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:31:45,632 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:31:45,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:31:45,634 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_22ec8ab6-1634-4c90-930b-a2a5132a8cb8/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 22:31:45,660 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:31:45,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:31:45,671 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:31:45,672 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:31:45,672 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:31:45,672 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:31:45,672 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:31:45,673 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:31:45,673 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:31:45,673 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:31:45,673 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:31:45,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:31:45,675 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:31:45,675 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:31:45,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:31:45,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:31:45,676 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:31:45,676 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:31:45,676 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:31:45,676 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:31:45,677 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:31:45,677 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:31:45,677 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:31:45,677 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:31:45,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:31:45,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:31:45,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:31:45,678 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:31:45,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:31:45,679 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:31:45,680 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:31:45,680 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:31:45,681 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/run_dir_22ec8ab6-1634-4c90-930b-a2a5132a8cb8/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-11-15 22:31:45,716 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:31:45,730 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:31:45,734 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:31:45,735 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:31:45,736 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:31:45,736 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_22ec8ab6-1634-4c90-930b-a2a5132a8cb8/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrlen-alloca-1.i [2019-11-15 22:31:45,799 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_22ec8ab6-1634-4c90-930b-a2a5132a8cb8/bin/uautomizer/data/0ce33593a/1aa44de3687c4384ae1d88f43f22d7e0/FLAGe4d2f0eb2 [2019-11-15 22:31:46,282 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:31:46,282 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_22ec8ab6-1634-4c90-930b-a2a5132a8cb8/sv-benchmarks/c/array-memsafety/openbsd_cstrlen-alloca-1.i [2019-11-15 22:31:46,294 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_22ec8ab6-1634-4c90-930b-a2a5132a8cb8/bin/uautomizer/data/0ce33593a/1aa44de3687c4384ae1d88f43f22d7e0/FLAGe4d2f0eb2 [2019-11-15 22:31:46,602 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_22ec8ab6-1634-4c90-930b-a2a5132a8cb8/bin/uautomizer/data/0ce33593a/1aa44de3687c4384ae1d88f43f22d7e0 [2019-11-15 22:31:46,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:31:46,605 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:31:46,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:31:46,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:31:46,609 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:31:46,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:31:46" (1/1) ... [2019-11-15 22:31:46,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f23af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:31:46, skipping insertion in model container [2019-11-15 22:31:46,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:31:46" (1/1) ... [2019-11-15 22:31:46,618 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:31:46,661 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:31:46,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:31:46,996 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:31:47,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:31:47,093 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:31:47,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:31:47 WrapperNode [2019-11-15 22:31:47,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:31:47,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:31:47,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:31:47,096 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:31:47,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:31:47" (1/1) ... [2019-11-15 22:31:47,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:31:47" (1/1) ... [2019-11-15 22:31:47,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:31:47,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:31:47,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:31:47,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:31:47,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:31:47" (1/1) ... [2019-11-15 22:31:47,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:31:47" (1/1) ... [2019-11-15 22:31:47,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:31:47" (1/1) ... [2019-11-15 22:31:47,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:31:47" (1/1) ... [2019-11-15 22:31:47,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:31:47" (1/1) ... [2019-11-15 22:31:47,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:31:47" (1/1) ... [2019-11-15 22:31:47,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:31:47" (1/1) ... [2019-11-15 22:31:47,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:31:47,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:31:47,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:31:47,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:31:47,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:31:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22ec8ab6-1634-4c90-930b-a2a5132a8cb8/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-11-15 22:31:47,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:31:47,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:31:47,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:31:47,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:31:47,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:31:47,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:31:47,538 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:31:47,539 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 22:31:47,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:31:47 BoogieIcfgContainer [2019-11-15 22:31:47,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:31:47,540 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:31:47,541 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:31:47,545 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:31:47,545 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:31:47,545 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:31:46" (1/3) ... [2019-11-15 22:31:47,547 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25268c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:31:47, skipping insertion in model container [2019-11-15 22:31:47,547 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:31:47,547 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:31:47" (2/3) ... [2019-11-15 22:31:47,547 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25268c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:31:47, skipping insertion in model container [2019-11-15 22:31:47,547 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:31:47,548 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:31:47" (3/3) ... [2019-11-15 22:31:47,551 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrlen-alloca-1.i [2019-11-15 22:31:47,606 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:31:47,606 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:31:47,606 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:31:47,607 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:31:47,607 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:31:47,607 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:31:47,607 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:31:47,607 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:31:47,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-15 22:31:47,645 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 22:31:47,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:31:47,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:31:47,651 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 22:31:47,652 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:31:47,652 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:31:47,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-15 22:31:47,656 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 22:31:47,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:31:47,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:31:47,657 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 22:31:47,657 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:31:47,664 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-11-15 22:31:47,665 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-11-15 22:31:47,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:47,670 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-15 22:31:47,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:47,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961869375] [2019-11-15 22:31:47,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:47,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:47,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:31:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:31:47,818 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:31:47,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:47,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-11-15 22:31:47,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:47,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787911259] [2019-11-15 22:31:47,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:47,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:47,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:31:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:31:47,838 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:31:47,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:47,839 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-11-15 22:31:47,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:47,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79039314] [2019-11-15 22:31:47,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:47,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:47,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:31:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:31:47,877 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:31:48,071 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:31:48,072 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:31:48,072 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:31:48,072 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:31:48,072 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:31:48,073 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:31:48,073 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:31:48,073 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:31:48,073 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlen-alloca-1.i_Iteration1_Lasso [2019-11-15 22:31:48,073 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:31:48,074 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:31:48,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:31:48,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:31:48,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:31:48,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:31:48,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:31:48,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:31:48,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:31:48,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:31:48,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:31:48,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:31:48,621 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:31:48,626 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:31:48,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-11-15 22:31:48,629 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:31:48,630 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:31:48,630 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:31:48,630 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:31:48,630 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:31:48,632 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:31:48,632 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:31:48,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:31:48,634 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-11-15 22:31:48,635 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:31:48,635 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:31:48,635 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:31:48,635 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:31:48,635 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:31:48,636 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:31:48,636 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:31:48,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:31:48,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-11-15 22:31:48,638 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:31:48,638 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:31:48,638 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:31:48,638 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:31:48,638 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:31:48,639 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:31:48,639 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:31:48,640 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:31:48,641 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-11-15 22:31:48,641 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:31:48,641 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:31:48,642 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:31:48,642 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:31:48,644 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:31:48,645 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:31:48,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:31:48,649 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-11-15 22:31:48,650 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:31:48,650 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:31:48,650 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:31:48,650 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:31:48,652 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:31:48,652 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:31:48,657 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:31:48,657 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-11-15 22:31:48,666 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:31:48,666 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:31:48,666 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:31:48,667 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:31:48,668 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:31:48,669 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:31:48,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:31:48,675 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-11-15 22:31:48,675 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:31:48,675 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:31:48,676 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:31:48,676 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:31:48,676 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:31:48,676 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:31:48,677 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:31:48,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:31:48,678 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-11-15 22:31:48,679 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:31:48,679 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:31:48,679 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:31:48,679 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:31:48,701 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:31:48,701 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:31:48,812 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:31:48,873 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-15 22:31:48,873 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 22:31:48,875 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:31:48,877 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:31:48,877 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:31:48,878 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-11-15 22:31:48,893 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 22:31:48,902 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:31:48,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:48,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:31:48,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:31:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:48,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:31:48,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:31:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:31:48,995 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-11-15 22:31:48,996 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-11-15 22:31:49,057 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-11-15 22:31:49,057 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-11-15 22:31:49,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:31:49,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2019-11-15 22:31:49,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-15 22:31:49,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:31:49,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-15 22:31:49,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:31:49,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-15 22:31:49,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:31:49,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2019-11-15 22:31:49,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:31:49,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 11 states and 14 transitions. [2019-11-15 22:31:49,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 22:31:49,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 22:31:49,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-11-15 22:31:49,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:31:49,073 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-15 22:31:49,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-11-15 22:31:49,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-15 22:31:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 22:31:49,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-11-15 22:31:49,096 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-15 22:31:49,096 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-15 22:31:49,096 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:31:49,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-11-15 22:31:49,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:31:49,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:31:49,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:31:49,098 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:31:49,098 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:31:49,099 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-11-15 22:31:49,099 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-11-15 22:31:49,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:49,099 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-11-15 22:31:49,100 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:49,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443259231] [2019-11-15 22:31:49,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:49,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:49,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:31:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:31:49,122 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:31:49,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:49,123 INFO L82 PathProgramCache]: Analyzing trace with hash 56764, now seen corresponding path program 1 times [2019-11-15 22:31:49,123 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:49,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792066295] [2019-11-15 22:31:49,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:49,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:49,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:31:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:31:49,132 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:31:49,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:49,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1183925680, now seen corresponding path program 1 times [2019-11-15 22:31:49,133 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:49,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182561050] [2019-11-15 22:31:49,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:49,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:49,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:49,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:31:49,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182561050] [2019-11-15 22:31:49,290 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:31:49,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:31:49,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715966316] [2019-11-15 22:31:49,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:31:49,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:31:49,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:31:49,346 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-11-15 22:31:49,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:49,435 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-11-15 22:31:49,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:31:49,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-11-15 22:31:49,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:31:49,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 12 states and 14 transitions. [2019-11-15 22:31:49,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 22:31:49,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 22:31:49,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2019-11-15 22:31:49,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:31:49,439 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-11-15 22:31:49,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2019-11-15 22:31:49,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-11-15 22:31:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 22:31:49,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-11-15 22:31:49,440 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-11-15 22:31:49,441 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-11-15 22:31:49,441 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:31:49,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2019-11-15 22:31:49,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:31:49,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:31:49,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:31:49,442 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:31:49,442 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:31:49,442 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-11-15 22:31:49,443 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-11-15 22:31:49,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:49,443 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-11-15 22:31:49,443 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:49,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048605159] [2019-11-15 22:31:49,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:49,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:49,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:31:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:31:49,472 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:31:49,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:49,482 INFO L82 PathProgramCache]: Analyzing trace with hash 56764, now seen corresponding path program 2 times [2019-11-15 22:31:49,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:49,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340515917] [2019-11-15 22:31:49,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:49,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:49,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:31:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:31:49,500 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:31:49,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:49,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1235379726, now seen corresponding path program 1 times [2019-11-15 22:31:49,500 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:31:49,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747249770] [2019-11-15 22:31:49,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:49,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:31:49,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:31:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:31:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:31:49,541 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:31:49,838 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-11-15 22:31:49,934 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:31:49,934 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:31:49,934 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:31:49,934 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:31:49,934 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:31:49,934 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:31:49,935 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:31:49,935 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:31:49,935 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlen-alloca-1.i_Iteration3_Lasso [2019-11-15 22:31:49,935 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:31:49,935 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:31:49,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:31:49,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-11-15 22:31:49,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-11-15 22:31:49,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-11-15 22:31:49,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:31:49,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:31:50,114 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-11-15 22:31:50,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:31:50,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:31:50,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:31:50,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:31:50,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:31:50,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:31:50,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:31:50,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:31:50,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:31:50,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:31:50,545 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:31:50,545 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:31:50,545 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-11-15 22:31:50,546 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:31:50,546 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:31:50,546 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:31:50,547 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:31:50,547 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:31:50,547 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:31:50,547 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:31:50,548 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:31:50,548 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-11-15 22:31:50,549 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:31:50,549 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:31:50,549 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:31:50,549 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:31:50,549 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:31:50,550 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:31:50,550 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:31:50,550 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:31:50,551 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-11-15 22:31:50,551 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:31:50,551 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:31:50,551 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:31:50,551 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:31:50,551 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:31:50,552 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:31:50,552 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:31:50,552 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:31:50,553 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-11-15 22:31:50,553 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:31:50,553 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:31:50,553 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:31:50,553 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:31:50,554 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:31:50,554 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:31:50,554 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:31:50,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:31:50,555 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-11-15 22:31:50,555 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:31:50,555 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:31:50,555 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:31:50,556 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:31:50,558 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:31:50,558 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:31:50,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:31:50,561 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-11-15 22:31:50,561 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:31:50,561 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:31:50,562 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:31:50,562 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:31:50,567 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:31:50,567 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:31:50,606 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:31:50,650 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:31:50,656 INFO L444 ModelExtractionUtils]: 27 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:31:50,657 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:31:50,658 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:31:50,659 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:31:50,659 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-11-15 22:31:50,687 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-11-15 22:31:50,690 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:31:50,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:31:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:50,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:31:50,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:31:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:31:50,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:31:50,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:31:50,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:31:50,751 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-11-15 22:31:50,751 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-15 22:31:50,762 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-11-15 22:31:50,763 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-11-15 22:31:50,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:31:50,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-11-15 22:31:50,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-15 22:31:50,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:31:50,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-15 22:31:50,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:31:50,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-15 22:31:50,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:31:50,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-11-15 22:31:50,765 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:31:50,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2019-11-15 22:31:50,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:31:50,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:31:50,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:31:50,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:31:50,766 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:31:50,766 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:31:50,766 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:31:50,766 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:31:50,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:31:50,766 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:31:50,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:31:50,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:31:50 BoogieIcfgContainer [2019-11-15 22:31:50,772 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:31:50,772 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:31:50,773 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:31:50,773 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:31:50,774 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:31:47" (3/4) ... [2019-11-15 22:31:50,777 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:31:50,777 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:31:50,779 INFO L168 Benchmark]: Toolchain (without parser) took 4173.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -118.6 MB). Peak memory consumption was 81.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:31:50,779 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:31:50,780 INFO L168 Benchmark]: CACSL2BoogieTranslator took 489.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -238.3 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:31:50,781 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:31:50,781 INFO L168 Benchmark]: Boogie Preprocessor took 31.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:31:50,782 INFO L168 Benchmark]: RCFGBuilder took 367.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:31:50,782 INFO L168 Benchmark]: BuchiAutomizer took 3231.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 97.4 MB). Peak memory consumption was 97.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:31:50,783 INFO L168 Benchmark]: Witness Printer took 4.65 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-11-15 22:31:50,786 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 489.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -238.3 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 367.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3231.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 97.4 MB). Peak memory consumption was 97.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.65 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. * 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 3.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. 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: 8ms 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...