./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/rec_strlen-alloca-2.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/rec_strlen-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 670ba1f7b305b901cafb6eb07f9685f38a74d232de67a28beb70e276cc8ee0cd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:33:24,259 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:33:24,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:33:24,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:33:24,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:33:24,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:33:24,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:33:24,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:33:24,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:33:24,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:33:24,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:33:24,297 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:33:24,297 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:33:24,298 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:33:24,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:33:24,299 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:33:24,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:33:24,300 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:33:24,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:33:24,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:33:24,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:33:24,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:33:24,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:33:24,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:33:24,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:33:24,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:33:24,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:33:24,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:33:24,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:33:24,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:33:24,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:33:24,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:33:24,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:33:24,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:33:24,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:33:24,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:33:24,314 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:33:24,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:33:24,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:33:24,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:33:24,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:33:24,320 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:33:24,339 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:33:24,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:33:24,340 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:33:24,340 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:33:24,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:33:24,341 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:33:24,341 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:33:24,341 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:33:24,341 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:33:24,341 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:33:24,341 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:33:24,342 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:33:24,342 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:33:24,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:33:24,342 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:33:24,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:33:24,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:33:24,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:33:24,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:33:24,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:33:24,343 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:33:24,343 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:33:24,344 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:33:24,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:33:24,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:33:24,344 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:33:24,344 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:33:24,344 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:33:24,345 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:33:24,345 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 670ba1f7b305b901cafb6eb07f9685f38a74d232de67a28beb70e276cc8ee0cd [2022-02-21 03:33:24,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:33:24,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:33:24,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:33:24,511 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:33:24,513 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:33:24,514 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/rec_strlen-alloca-2.i [2022-02-21 03:33:24,566 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/440dfe835/38d6894c7fd5411a85c19492b40a7b7c/FLAG22cc87d20 [2022-02-21 03:33:24,955 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:33:24,956 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/rec_strlen-alloca-2.i [2022-02-21 03:33:24,963 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/440dfe835/38d6894c7fd5411a85c19492b40a7b7c/FLAG22cc87d20 [2022-02-21 03:33:24,977 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/440dfe835/38d6894c7fd5411a85c19492b40a7b7c [2022-02-21 03:33:24,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:33:24,981 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:33:24,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:33:24,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:33:24,986 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:33:24,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:33:24" (1/1) ... [2022-02-21 03:33:24,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@696b9ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:24, skipping insertion in model container [2022-02-21 03:33:24,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:33:24" (1/1) ... [2022-02-21 03:33:24,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:33:25,023 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:33:25,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:33:25,220 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:33:25,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:33:25,261 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:33:25,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:25 WrapperNode [2022-02-21 03:33:25,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:33:25,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:33:25,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:33:25,264 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:33:25,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:25" (1/1) ... [2022-02-21 03:33:25,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:25" (1/1) ... [2022-02-21 03:33:25,299 INFO L137 Inliner]: procedures = 111, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 16 [2022-02-21 03:33:25,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:33:25,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:33:25,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:33:25,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:33:25,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:25" (1/1) ... [2022-02-21 03:33:25,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:25" (1/1) ... [2022-02-21 03:33:25,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:25" (1/1) ... [2022-02-21 03:33:25,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:25" (1/1) ... [2022-02-21 03:33:25,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:25" (1/1) ... [2022-02-21 03:33:25,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:25" (1/1) ... [2022-02-21 03:33:25,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:25" (1/1) ... [2022-02-21 03:33:25,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:33:25,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:33:25,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:33:25,323 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:33:25,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:25" (1/1) ... [2022-02-21 03:33:25,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:25,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:25,345 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:25,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:33:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:33:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:33:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:33:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:33:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure strlen_rec [2022-02-21 03:33:25,373 INFO L138 BoogieDeclarations]: Found implementation of procedure strlen_rec [2022-02-21 03:33:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:33:25,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:33:25,460 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:33:25,461 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:33:25,561 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:33:25,566 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:33:25,566 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 03:33:25,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:33:25 BoogieIcfgContainer [2022-02-21 03:33:25,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:33:25,568 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:33:25,568 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:33:25,569 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:33:25,570 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:33:25,570 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:33:24" (1/3) ... [2022-02-21 03:33:25,572 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23acca0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:33:25, skipping insertion in model container [2022-02-21 03:33:25,572 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:33:25,572 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:25" (2/3) ... [2022-02-21 03:33:25,573 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23acca0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:33:25, skipping insertion in model container [2022-02-21 03:33:25,573 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:33:25,573 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:33:25" (3/3) ... [2022-02-21 03:33:25,574 INFO L388 chiAutomizerObserver]: Analyzing ICFG rec_strlen-alloca-2.i [2022-02-21 03:33:25,601 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:33:25,601 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:33:25,601 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:33:25,601 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:33:25,601 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:33:25,601 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:33:25,602 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:33:25,602 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:33:25,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:33:25,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:25,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:25,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:25,633 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:33:25,633 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:33:25,634 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:33:25,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:33:25,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:25,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:25,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:25,637 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:33:25,637 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:33:25,642 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~ret6#1, main_~length1~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;main_~length1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11#L555true assume !(main_~length1~0#1 < 1); 8#L555-2true call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1); 6#L560true call main_#t~ret6#1 := strlen_rec(main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset);< 13#strlen_recENTRYtrue [2022-02-21 03:33:25,642 INFO L793 eck$LassoCheckResult]: Loop: 13#strlen_recENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 1); 14#L548true assume !(0 == #t~mem2);havoc #t~mem2; 15#L551true call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset);< 13#strlen_recENTRYtrue [2022-02-21 03:33:25,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:25,650 INFO L85 PathProgramCache]: Analyzing trace with hash 28695762, now seen corresponding path program 1 times [2022-02-21 03:33:25,659 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:25,659 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728659859] [2022-02-21 03:33:25,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:25,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:25,754 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:25,795 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:25,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:25,798 INFO L85 PathProgramCache]: Analyzing trace with hash 44820, now seen corresponding path program 1 times [2022-02-21 03:33:25,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:25,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077641740] [2022-02-21 03:33:25,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:25,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:25,815 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:25,830 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:25,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:25,832 INFO L85 PathProgramCache]: Analyzing trace with hash 176968867, now seen corresponding path program 1 times [2022-02-21 03:33:25,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:25,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917757452] [2022-02-21 03:33:25,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:25,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:25,875 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:25,902 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:26,662 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:33:26,662 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:33:26,662 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:33:26,662 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:33:26,663 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:33:26,663 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:26,663 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:33:26,663 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:33:26,663 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_strlen-alloca-2.i_Iteration1_Lasso [2022-02-21 03:33:26,663 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:33:26,663 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:33:26,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,787 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:33:26,788 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:33:26,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:26,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:27,104 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:33:27,107 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:33:27,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:27,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:27,111 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:27,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:33:27,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:27,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:27,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:27,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:27,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:27,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:27,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:27,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:27,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:27,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:27,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:27,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:27,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:27,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:33:27,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:27,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:27,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:27,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:27,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:27,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:27,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:27,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:27,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:27,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:27,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:27,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:27,194 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:27,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:33:27,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:27,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:27,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:27,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:27,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:27,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:27,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:27,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:27,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:27,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:27,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:27,229 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:27,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:33:27,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:27,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:27,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:27,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:27,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:27,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:27,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:27,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:27,267 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:27,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:27,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:27,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:27,284 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:27,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:33:27,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:27,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:27,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:27,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:27,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:27,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:27,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:27,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:27,302 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:27,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:27,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:27,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:27,319 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:27,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:33:27,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:27,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:27,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:27,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:27,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:27,331 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:27,331 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:27,340 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:33:27,349 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-02-21 03:33:27,349 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-02-21 03:33:27,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:27,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:27,352 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:27,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:33:27,353 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:33:27,384 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:33:27,384 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:33:27,385 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length strlen_rec_#in~p.base)_1, strlen_rec_#in~p.offset) = 1*v_rep(select #length strlen_rec_#in~p.base)_1 - 1*strlen_rec_#in~p.offset Supporting invariants [] [2022-02-21 03:33:27,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:27,412 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:33:27,416 INFO L390 LassoCheck]: Loop: "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 1);" "assume !(0 == #t~mem2);havoc #t~mem2;" "call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset);"< [2022-02-21 03:33:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:27,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:27,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:33:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:27,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:27,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {25#unseeded} is VALID [2022-02-21 03:33:27,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~ret6#1, main_~length1~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;main_~length1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {25#unseeded} is VALID [2022-02-21 03:33:27,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#unseeded} assume !(main_~length1~0#1 < 1); {25#unseeded} is VALID [2022-02-21 03:33:27,511 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#unseeded} call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1); {25#unseeded} is VALID [2022-02-21 03:33:27,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#unseeded} call main_#t~ret6#1 := strlen_rec(main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset); {25#unseeded} is VALID [2022-02-21 03:33:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:27,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:33:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:27,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:27,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(>= oldRank0 (+ (* (- 1) |strlen_rec_#in~p.offset|) (select |#length| |strlen_rec_#in~p.base|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 1); {60#(and (<= (select |#length| strlen_rec_~p.base) (+ oldRank0 strlen_rec_~p.offset)) (<= (+ strlen_rec_~p.offset 1) (select |#length| strlen_rec_~p.base)))} is VALID [2022-02-21 03:33:27,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#(and (<= (select |#length| strlen_rec_~p.base) (+ oldRank0 strlen_rec_~p.offset)) (<= (+ strlen_rec_~p.offset 1) (select |#length| strlen_rec_~p.base)))} assume !(0 == #t~mem2);havoc #t~mem2; {60#(and (<= (select |#length| strlen_rec_~p.base) (+ oldRank0 strlen_rec_~p.offset)) (<= (+ strlen_rec_~p.offset 1) (select |#length| strlen_rec_~p.base)))} is VALID [2022-02-21 03:33:27,594 INFO L272 TraceCheckUtils]: 2: Hoare triple {60#(and (<= (select |#length| strlen_rec_~p.base) (+ oldRank0 strlen_rec_~p.offset)) (<= (+ strlen_rec_~p.offset 1) (select |#length| strlen_rec_~p.base)))} call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset); {43#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |strlen_rec_#in~p.offset|) (select |#length| |strlen_rec_#in~p.base|)))) unseeded)} is VALID [2022-02-21 03:33:27,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:33:27,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:27,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:33:27,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:33:27,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,623 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 [2022-02-21 03:33:27,624 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:27,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:27,739 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 35 transitions. Complement of second has 8 states. [2022-02-21 03:33:27,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:33:27,740 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:27,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:33:27,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:27,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:27,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:27,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:27,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:33:27,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:27,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:27,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2022-02-21 03:33:27,746 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:33:27,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:33:27,747 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:33:27,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:27,749 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:33:27,750 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:27,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:33:27,751 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:33:27,751 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 35 transitions. cyclomatic complexity: 6 [2022-02-21 03:33:27,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. cyclomatic complexity: 6 [2022-02-21 03:33:27,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:33:27,751 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:33:27,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:33:27,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:33:27,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:33:27,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:27,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:27,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:27,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:33:27,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:33:27,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 6 Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:33:27,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:33:27,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:33:27,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:33:27,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:33:27,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:33:27,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:33:27,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:33:27,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:33:27,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:33:27,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:33:27,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:33:27,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:33:27,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:33:27,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:33:27,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:33:27,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:27,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:27,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:27,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,761 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:27,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:27,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 03:33:27,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:33:27,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:33:27,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:33:27,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:27,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. cyclomatic complexity: 6 [2022-02-21 03:33:27,769 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:33:27,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2022-02-21 03:33:27,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:33:27,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:33:27,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:33:27,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:33:27,772 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:33:27,772 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:33:27,772 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:33:27,772 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:33:27,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:33:27,772 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:33:27,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:33:27,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:33:27 BoogieIcfgContainer [2022-02-21 03:33:27,777 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:33:27,777 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:33:27,777 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:33:27,777 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:33:27,778 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:33:25" (3/4) ... [2022-02-21 03:33:27,779 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:33:27,780 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:33:27,780 INFO L158 Benchmark]: Toolchain (without parser) took 2799.61ms. Allocated memory was 115.3MB in the beginning and 159.4MB in the end (delta: 44.0MB). Free memory was 81.1MB in the beginning and 123.2MB in the end (delta: -42.1MB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. [2022-02-21 03:33:27,781 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 75.5MB. Free memory was 49.1MB in the beginning and 49.0MB in the end (delta: 27.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:33:27,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.68ms. Allocated memory is still 115.3MB. Free memory was 80.9MB in the beginning and 86.9MB in the end (delta: -6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:33:27,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.59ms. Allocated memory is still 115.3MB. Free memory was 86.9MB in the beginning and 84.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:33:27,782 INFO L158 Benchmark]: Boogie Preprocessor took 17.83ms. Allocated memory is still 115.3MB. Free memory was 84.8MB in the beginning and 83.9MB in the end (delta: 891.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:33:27,782 INFO L158 Benchmark]: RCFGBuilder took 248.71ms. Allocated memory is still 115.3MB. Free memory was 83.9MB in the beginning and 73.7MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:33:27,783 INFO L158 Benchmark]: BuchiAutomizer took 2209.05ms. Allocated memory was 115.3MB in the beginning and 159.4MB in the end (delta: 44.0MB). Free memory was 73.7MB in the beginning and 124.3MB in the end (delta: -50.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:33:27,783 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 159.4MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:33:27,784 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 75.5MB. Free memory was 49.1MB in the beginning and 49.0MB in the end (delta: 27.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.68ms. Allocated memory is still 115.3MB. Free memory was 80.9MB in the beginning and 86.9MB in the end (delta: -6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.59ms. Allocated memory is still 115.3MB. Free memory was 86.9MB in the beginning and 84.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.83ms. Allocated memory is still 115.3MB. Free memory was 84.8MB in the beginning and 83.9MB in the end (delta: 891.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 248.71ms. Allocated memory is still 115.3MB. Free memory was 83.9MB in the beginning and 73.7MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 2209.05ms. Allocated memory was 115.3MB in the beginning and 159.4MB in the end (delta: 44.0MB). Free memory was 73.7MB in the beginning and 124.3MB in the end (delta: -50.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 159.4MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * p + unknown-#length-unknown[p] and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 10 mSDtfsCounter, 10 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital86 mio100 ax120 hnf100 lsp76 ukn66 mio100 lsp47 div100 bol100 ite100 ukn100 eq172 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms 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! [2022-02-21 03:33:27,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE