./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- 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/array-memsafety/openbsd_cstrcmp-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 34ebd55fb329f5d1f91a7448416ebb87d44ad143bdc373b65c05d35b2199abdd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:35:18,601 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:35:18,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:35:18,639 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:35:18,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:35:18,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:35:18,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:35:18,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:35:18,651 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:35:18,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:35:18,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:35:18,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:35:18,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:35:18,676 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:35:18,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:35:18,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:35:18,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:35:18,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:35:18,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:35:18,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:35:18,690 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:35:18,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:35:18,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:35:18,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:35:18,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:35:18,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:35:18,706 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:35:18,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:35:18,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:35:18,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:35:18,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:35:18,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:35:18,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:35:18,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:35:18,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:35:18,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:35:18,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:35:18,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:35:18,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:35:18,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:35:18,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:35:18,729 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:35:18,763 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:35:18,763 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:35:18,764 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:35:18,764 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:35:18,765 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:35:18,765 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:35:18,765 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:35:18,765 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:35:18,766 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:35:18,766 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:35:18,766 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:35:18,767 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:35:18,767 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:35:18,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:35:18,767 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:35:18,767 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:35:18,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:35:18,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:35:18,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:35:18,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:35:18,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:35:18,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:35:18,768 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:35:18,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:35:18,769 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:35:18,769 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:35:18,769 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:35:18,769 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:35:18,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:35:18,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:35:18,769 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:35:18,770 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:35:18,771 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 34ebd55fb329f5d1f91a7448416ebb87d44ad143bdc373b65c05d35b2199abdd [2022-02-21 04:35:19,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:35:19,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:35:19,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:35:19,186 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:35:19,187 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:35:19,188 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i [2022-02-21 04:35:19,254 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d50b7bfa/ebf7cb57b16841e680e9c82ba4d48855/FLAG0b795862f [2022-02-21 04:35:19,715 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:35:19,716 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i [2022-02-21 04:35:19,738 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d50b7bfa/ebf7cb57b16841e680e9c82ba4d48855/FLAG0b795862f [2022-02-21 04:35:20,089 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d50b7bfa/ebf7cb57b16841e680e9c82ba4d48855 [2022-02-21 04:35:20,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:35:20,095 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:35:20,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:20,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:35:20,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:35:20,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:20" (1/1) ... [2022-02-21 04:35:20,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10170de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:20, skipping insertion in model container [2022-02-21 04:35:20,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:20" (1/1) ... [2022-02-21 04:35:20,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:35:20,162 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:35:20,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:20,436 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:35:20,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:20,495 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:35:20,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:20 WrapperNode [2022-02-21 04:35:20,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:20,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:20,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:35:20,498 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:35:20,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:20" (1/1) ... [2022-02-21 04:35:20,521 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:20" (1/1) ... [2022-02-21 04:35:20,538 INFO L137 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 86 [2022-02-21 04:35:20,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:20,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:35:20,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:35:20,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:35:20,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:20" (1/1) ... [2022-02-21 04:35:20,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:20" (1/1) ... [2022-02-21 04:35:20,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:20" (1/1) ... [2022-02-21 04:35:20,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:20" (1/1) ... [2022-02-21 04:35:20,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:20" (1/1) ... [2022-02-21 04:35:20,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:20" (1/1) ... [2022-02-21 04:35:20,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:20" (1/1) ... [2022-02-21 04:35:20,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:35:20,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:35:20,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:35:20,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:35:20,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:20" (1/1) ... [2022-02-21 04:35:20,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:20,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:20,631 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 04:35:20,637 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 04:35:20,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:35:20,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:35:20,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:35:20,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:35:20,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:35:20,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:35:20,762 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:35:20,763 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:35:21,191 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:35:21,196 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:35:21,196 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-21 04:35:21,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:21 BoogieIcfgContainer [2022-02-21 04:35:21,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:35:21,198 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:35:21,198 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:35:21,223 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:35:21,224 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:21,224 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:35:20" (1/3) ... [2022-02-21 04:35:21,225 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f4e93eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:21, skipping insertion in model container [2022-02-21 04:35:21,225 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:21,225 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:20" (2/3) ... [2022-02-21 04:35:21,225 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f4e93eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:21, skipping insertion in model container [2022-02-21 04:35:21,225 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:21,225 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:21" (3/3) ... [2022-02-21 04:35:21,226 INFO L388 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrcmp-alloca-1.i [2022-02-21 04:35:21,286 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:35:21,287 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:35:21,287 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:35:21,287 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:35:21,287 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:35:21,287 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:35:21,287 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:35:21,287 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:35:21,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:21,329 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 04:35:21,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:21,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:21,333 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:21,334 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:21,334 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:35:21,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:21,341 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 04:35:21,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:21,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:21,343 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:21,343 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:21,349 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 13#L524true assume !(main_~length1~0#1 < 1); 18#L524-2true assume !(main_~length2~0#1 < 1); 6#L527-1true call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 14#L533-3true [2022-02-21 04:35:21,350 INFO L793 eck$LassoCheckResult]: Loop: 14#L533-3true assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 3#L533-2true main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 14#L533-3true [2022-02-21 04:35:21,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:21,371 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 04:35:21,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:21,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959111263] [2022-02-21 04:35:21,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:21,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:21,524 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:21,567 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:21,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:21,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-02-21 04:35:21,572 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:21,572 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651981180] [2022-02-21 04:35:21,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:21,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:21,599 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:21,614 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:21,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:21,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-02-21 04:35:21,617 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:21,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893127436] [2022-02-21 04:35:21,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:21,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:21,653 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:21,691 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:22,046 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:22,047 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:22,047 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:22,047 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:22,048 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:22,048 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:22,048 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:22,048 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:22,048 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcmp-alloca-1.i_Iteration1_Lasso [2022-02-21 04:35:22,048 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:22,048 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:22,062 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 04:35:22,067 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 04:35:22,073 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 04:35:22,075 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 04:35:22,077 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 04:35:22,079 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 04:35:22,081 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 04:35:22,084 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 04:35:22,087 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 04:35:22,089 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 04:35:22,244 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 04:35:22,246 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 04:35:22,248 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 04:35:22,250 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 04:35:22,252 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 04:35:22,545 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:22,548 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:22,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:22,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:22,551 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 04:35:22,554 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 04:35:22,555 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 04:35:22,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:22,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:22,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:22,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:22,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:22,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:22,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:22,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:22,617 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 04:35:22,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:22,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:22,619 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 04:35:22,619 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 04:35:22,621 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 04:35:22,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:22,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:22,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:22,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:22,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:22,630 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:22,645 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:22,665 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 04:35:22,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:22,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:22,667 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 04:35:22,668 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 04:35:22,670 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 04:35:22,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:22,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:22,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:22,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:22,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:22,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:22,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:22,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:22,709 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 04:35:22,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:22,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:22,710 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 04:35:22,727 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 04:35:22,729 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 04:35:22,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:22,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:22,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:22,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:22,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:22,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:22,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:22,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:22,767 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 04:35:22,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:22,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:22,769 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 04:35:22,770 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 04:35:22,771 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 04:35:22,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:22,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:22,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:22,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:22,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:22,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:22,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:22,793 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:22,811 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 04:35:22,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:22,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:22,813 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 04:35:22,814 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 04:35:22,816 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 04:35:22,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:22,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:22,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:22,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:22,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:22,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:22,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:22,848 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:22,864 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 04:35:22,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:22,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:22,866 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 04:35:22,867 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 04:35:22,868 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 04:35:22,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:22,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:22,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:22,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:22,876 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:22,876 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:22,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:22,911 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 04:35:22,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:22,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:22,913 INFO L229 MonitoredProcess]: Starting monitored process 9 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 04:35:22,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:35:22,915 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 04:35:22,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:22,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:22,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:22,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:22,924 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:22,924 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:22,933 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:22,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:22,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:22,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:22,951 INFO L229 MonitoredProcess]: Starting monitored process 10 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 04:35:22,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:35:22,955 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 04:35:22,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:22,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:22,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:22,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:22,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:22,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:22,977 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:22,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:22,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:22,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:22,996 INFO L229 MonitoredProcess]: Starting monitored process 11 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 04:35:22,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 04:35:22,999 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 04:35:23,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:23,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:23,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:23,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:23,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:23,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:23,014 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:23,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:23,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:23,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:23,032 INFO L229 MonitoredProcess]: Starting monitored process 12 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 04:35:23,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 04:35:23,033 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 04:35:23,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:23,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:23,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:23,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:23,044 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:23,044 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:23,068 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:23,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:23,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:23,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:23,086 INFO L229 MonitoredProcess]: Starting monitored process 13 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 04:35:23,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 04:35:23,092 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 04:35:23,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:23,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:23,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:23,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:23,103 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:23,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:23,118 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:23,140 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-02-21 04:35:23,140 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-02-21 04:35:23,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:23,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:23,142 INFO L229 MonitoredProcess]: Starting monitored process 14 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 04:35:23,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:35:23,151 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:23,172 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 04:35:23,172 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:23,173 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_1) = -1*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_1 Supporting invariants [1*ULTIMATE.start_main_~nondetString1~0#1.offset >= 0] [2022-02-21 04:35:23,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:23,255 INFO L297 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2022-02-21 04:35:23,265 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1;" "main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2022-02-21 04:35:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:23,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:23,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 04:35:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:23,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:23,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {29#unseeded} is VALID [2022-02-21 04:35:23,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {29#unseeded} is VALID [2022-02-21 04:35:23,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#unseeded} assume !(main_~length1~0#1 < 1); {29#unseeded} is VALID [2022-02-21 04:35:23,356 INFO L290 TraceCheckUtils]: 3: Hoare triple {29#unseeded} assume !(main_~length2~0#1 < 1); {29#unseeded} is VALID [2022-02-21 04:35:23,356 INFO L290 TraceCheckUtils]: 4: Hoare triple {29#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {79#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded (>= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:23,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 04:35:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:23,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:23,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {80#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (>= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {100#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~i~0#1| 1) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (>= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:23,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {100#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~i~0#1| 1) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (>= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {82#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))))) (>= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:23,397 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 04:35:23,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:23,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:23,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:23,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,425 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 04:35:23,426 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:23,540 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 61 transitions. Complement of second has 8 states. [2022-02-21 04:35:23,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:23,541 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:23,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:23,549 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 04:35:23,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:23,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:23,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:23,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:23,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:23,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:23,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 61 transitions. [2022-02-21 04:35:23,557 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:35:23,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:23,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:23,560 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:23,563 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 04:35:23,565 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 04:35:23,565 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:23,568 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:23,568 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:23,569 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 61 transitions. cyclomatic complexity: 26 [2022-02-21 04:35:23,570 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 04:35:23,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:23,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:23,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:23,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 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 04:35:23,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 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 04:35:23,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:23,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:23,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:23,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:23,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 42 letters. [2022-02-21 04:35:23,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 42 letters. [2022-02-21 04:35:23,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 42 letters. Loop has 42 letters. [2022-02-21 04:35:23,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:35:23,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:35:23,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:35:23,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:23,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:23,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:23,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:23,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:23,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:23,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:23,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:23,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:23,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:23,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:23,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:23,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:23,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:23,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:23,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:23,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:23,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:23,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:23,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:23,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:23,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:23,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:23,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:23,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:23,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:23,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:23,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 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 04:35:23,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 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 04:35:23,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:23,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:23,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:23,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:23,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:23,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:23,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:23,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:23,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:23,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:23,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:23,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:23,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:23,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:23,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:23,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:23,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,608 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-02-21 04:35:23,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:23,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:23,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:35:23,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 61 transitions. cyclomatic complexity: 26 [2022-02-21 04:35:23,615 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:35:23,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 15 states and 20 transitions. [2022-02-21 04:35:23,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 04:35:23,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 04:35:23,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2022-02-21 04:35:23,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:23,619 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-02-21 04:35:23,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2022-02-21 04:35:23,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-21 04:35:23,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:23,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 20 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:23,635 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 20 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:23,636 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:23,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:23,639 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2022-02-21 04:35:23,639 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2022-02-21 04:35:23,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:23,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:23,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states and 20 transitions. [2022-02-21 04:35:23,640 INFO L87 Difference]: Start difference. First operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states and 20 transitions. [2022-02-21 04:35:23,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:23,640 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2022-02-21 04:35:23,640 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2022-02-21 04:35:23,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:23,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:23,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:23,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:23,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:23,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2022-02-21 04:35:23,642 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-02-21 04:35:23,642 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-02-21 04:35:23,643 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:35:23,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2022-02-21 04:35:23,643 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:35:23,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:23,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:23,643 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:23,643 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:23,644 INFO L791 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 161#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 169#L524 assume !(main_~length1~0#1 < 1); 171#L524-2 assume !(main_~length2~0#1 < 1); 162#L527-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 163#L533-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 170#L533-4 main_~i~1#1 := 0; 167#L537-3 [2022-02-21 04:35:23,644 INFO L793 eck$LassoCheckResult]: Loop: 167#L537-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 168#L537-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 167#L537-3 [2022-02-21 04:35:23,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:23,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2022-02-21 04:35:23,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:23,645 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360065382] [2022-02-21 04:35:23,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:23,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:23,663 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:23,669 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:23,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:23,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2022-02-21 04:35:23,670 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:23,670 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566034962] [2022-02-21 04:35:23,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:23,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:23,675 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:23,678 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:23,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:23,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2022-02-21 04:35:23,679 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:23,679 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373555632] [2022-02-21 04:35:23,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:23,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:23,691 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:23,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:23,722 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:23,980 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:23,981 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:23,981 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:23,981 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:23,981 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:23,981 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:23,981 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:23,981 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:23,981 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcmp-alloca-1.i_Iteration2_Lasso [2022-02-21 04:35:23,981 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:23,981 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:23,983 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 04:35:23,987 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 04:35:23,989 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 04:35:23,993 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 04:35:23,996 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 04:35:23,999 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 04:35:24,001 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 04:35:24,004 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 04:35:24,006 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 04:35:24,008 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 04:35:24,175 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 04:35:24,177 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 04:35:24,179 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 04:35:24,182 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 04:35:24,465 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:24,465 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:24,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:24,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:24,467 INFO L229 MonitoredProcess]: Starting monitored process 15 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 04:35:24,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:35:24,469 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 04:35:24,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:24,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:24,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:24,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:24,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:24,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:24,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:24,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:24,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:24,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:24,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:24,508 INFO L229 MonitoredProcess]: Starting monitored process 16 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 04:35:24,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:35:24,511 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 04:35:24,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:24,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:24,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:24,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:24,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:24,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:24,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:24,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:24,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:24,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:24,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:24,549 INFO L229 MonitoredProcess]: Starting monitored process 17 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 04:35:24,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:35:24,552 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 04:35:24,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:24,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:24,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:24,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:24,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:24,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:24,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:24,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:24,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:24,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:24,593 INFO L229 MonitoredProcess]: Starting monitored process 18 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 04:35:24,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:35:24,595 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 04:35:24,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:24,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:24,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:24,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:24,603 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:24,603 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:24,618 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:24,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:24,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:24,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:24,645 INFO L229 MonitoredProcess]: Starting monitored process 19 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 04:35:24,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:35:24,648 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 04:35:24,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:24,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:24,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:24,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:24,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:24,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:24,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:24,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:24,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:24,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:24,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:24,690 INFO L229 MonitoredProcess]: Starting monitored process 20 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 04:35:24,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:35:24,707 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 04:35:24,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:24,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:24,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:24,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:24,715 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:24,715 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:24,730 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:24,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:24,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:24,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:24,766 INFO L229 MonitoredProcess]: Starting monitored process 21 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 04:35:24,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 04:35:24,768 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 04:35:24,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:24,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:24,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:24,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:24,776 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:24,776 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:24,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:24,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:24,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:24,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:24,832 INFO L229 MonitoredProcess]: Starting monitored process 22 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 04:35:24,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 04:35:24,834 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 04:35:24,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:24,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:24,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:24,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:24,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:24,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:24,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:24,853 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:24,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:24,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:24,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:24,870 INFO L229 MonitoredProcess]: Starting monitored process 23 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 04:35:24,888 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 04:35:24,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:24,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:24,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:24,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:24,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:24,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:24,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:24,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 04:35:24,906 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:24,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:24,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:24,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:24,925 INFO L229 MonitoredProcess]: Starting monitored process 24 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 04:35:24,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 04:35:24,927 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 04:35:24,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:24,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:24,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:24,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:24,946 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:24,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:24,958 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:25,003 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2022-02-21 04:35:25,003 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2022-02-21 04:35:25,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:25,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:25,005 INFO L229 MonitoredProcess]: Starting monitored process 25 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 04:35:25,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 04:35:25,018 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:25,025 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:25,026 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:25,026 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~length2~0#1) = -1*ULTIMATE.start_main_~i~1#1 + 1*ULTIMATE.start_main_~length2~0#1 Supporting invariants [] [2022-02-21 04:35:25,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:25,061 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 04:35:25,064 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1;" "main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1;" [2022-02-21 04:35:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:25,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:25,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:35:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:25,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:25,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {212#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {212#unseeded} is VALID [2022-02-21 04:35:25,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {212#unseeded} is VALID [2022-02-21 04:35:25,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#unseeded} assume !(main_~length1~0#1 < 1); {212#unseeded} is VALID [2022-02-21 04:35:25,105 INFO L290 TraceCheckUtils]: 3: Hoare triple {212#unseeded} assume !(main_~length2~0#1 < 1); {212#unseeded} is VALID [2022-02-21 04:35:25,105 INFO L290 TraceCheckUtils]: 4: Hoare triple {212#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {212#unseeded} is VALID [2022-02-21 04:35:25,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#unseeded} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {212#unseeded} is VALID [2022-02-21 04:35:25,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {212#unseeded} main_~i~1#1 := 0; {212#unseeded} is VALID [2022-02-21 04:35:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:25,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:25,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:25,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {215#(>= oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|)))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; {278#(and (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length2~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|))))} is VALID [2022-02-21 04:35:25,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {278#(and (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length2~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|))))} main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {255#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|)))) unseeded)} is VALID [2022-02-21 04:35:25,130 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 04:35:25,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:25,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:25,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,148 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 04:35:25,148 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,186 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 30 transitions. Complement of second has 6 states. [2022-02-21 04:35:25,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:25,187 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:25,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2022-02-21 04:35:25,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:25,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:25,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:25,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:25,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:25,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2022-02-21 04:35:25,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:25,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:25,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:25,189 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2022-02-21 04:35:25,191 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 04:35:25,191 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:25,192 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:25,192 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 30 transitions. cyclomatic complexity: 13 [2022-02-21 04:35:25,194 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:35:25,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:25,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:25,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:25,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:25,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 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 04:35:25,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:25,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:25,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:25,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:25,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 21 letters. [2022-02-21 04:35:25,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 21 letters. [2022-02-21 04:35:25,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 21 letters. Loop has 21 letters. [2022-02-21 04:35:25,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2022-02-21 04:35:25,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 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 04:35:25,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 15 letters. [2022-02-21 04:35:25,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:25,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:25,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:25,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:25,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:25,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:25,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:25,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:25,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:25,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:25,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:25,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:25,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:25,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:25,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:25,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:25,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:25,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:25,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:25,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 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 04:35:25,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:25,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:25,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:25,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:25,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:25,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:25,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:25,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:25,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:25,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:25,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,212 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:25,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 04:35:25,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:25,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:25,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:35:25,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. cyclomatic complexity: 13 [2022-02-21 04:35:25,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:25,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 22 transitions. [2022-02-21 04:35:25,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 04:35:25,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 04:35:25,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2022-02-21 04:35:25,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:25,228 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2022-02-21 04:35:25,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2022-02-21 04:35:25,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-21 04:35:25,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:25,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 22 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,230 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 22 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,230 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:25,230 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2022-02-21 04:35:25,230 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2022-02-21 04:35:25,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:25,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:25,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 22 transitions. [2022-02-21 04:35:25,231 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 22 transitions. [2022-02-21 04:35:25,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:25,231 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2022-02-21 04:35:25,232 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2022-02-21 04:35:25,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:25,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:25,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:25,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:25,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2022-02-21 04:35:25,233 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2022-02-21 04:35:25,233 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2022-02-21 04:35:25,233 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:35:25,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2022-02-21 04:35:25,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:25,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:25,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:25,233 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:25,234 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:25,234 INFO L791 eck$LassoCheckResult]: Stem: 314#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 315#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 324#L524 assume !(main_~length1~0#1 < 1); 327#L524-2 assume !(main_~length2~0#1 < 1); 316#L527-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 317#L533-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 325#L533-4 main_~i~1#1 := 0; 321#L537-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 318#L537-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset, cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcmp_#res#1;havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, cstrcmp_#t~mem6#1, cstrcmp_#t~mem3#1, cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, cstrcmp_#t~mem4#1, cstrcmp_#t~mem8#1, cstrcmp_#t~pre7#1.base, cstrcmp_#t~pre7#1.offset, cstrcmp_#t~mem9#1, cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset; 319#L516-3 [2022-02-21 04:35:25,234 INFO L793 eck$LassoCheckResult]: Loop: 319#L516-3 call cstrcmp_#t~mem3#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post2#1.base, 1 + cstrcmp_#t~post2#1.offset;call cstrcmp_#t~mem4#1 := read~int(cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, 1); 320#L516-1 assume !!(cstrcmp_#t~mem3#1 == cstrcmp_#t~mem4#1);havoc cstrcmp_#t~mem3#1;havoc cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset;havoc cstrcmp_#t~mem4#1;cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post5#1.base, 1 + cstrcmp_#t~post5#1.offset;call cstrcmp_#t~mem6#1 := read~int(cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, 1); 326#L517 assume !(0 == cstrcmp_#t~mem6#1);havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset;havoc cstrcmp_#t~mem6#1; 319#L516-3 [2022-02-21 04:35:25,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:25,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2022-02-21 04:35:25,235 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:25,235 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452254563] [2022-02-21 04:35:25,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:25,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:25,285 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:25,294 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:25,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:25,295 INFO L85 PathProgramCache]: Analyzing trace with hash 77620, now seen corresponding path program 1 times [2022-02-21 04:35:25,295 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:25,295 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149664963] [2022-02-21 04:35:25,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:25,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:25,301 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:25,306 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:25,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:25,306 INFO L85 PathProgramCache]: Analyzing trace with hash -296047681, now seen corresponding path program 1 times [2022-02-21 04:35:25,306 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:25,307 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570881902] [2022-02-21 04:35:25,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:25,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:25,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {367#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {367#true} is VALID [2022-02-21 04:35:25,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {367#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {367#true} is VALID [2022-02-21 04:35:25,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {367#true} assume !(main_~length1~0#1 < 1); {369#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:35:25,441 INFO L290 TraceCheckUtils]: 3: Hoare triple {369#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} assume !(main_~length2~0#1 < 1); {369#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:35:25,442 INFO L290 TraceCheckUtils]: 4: Hoare triple {369#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {370#(and (or (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)))} is VALID [2022-02-21 04:35:25,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {370#(and (or (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {371#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))} is VALID [2022-02-21 04:35:25,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {371#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))} main_~i~1#1 := 0; {371#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))} is VALID [2022-02-21 04:35:25,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {371#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {371#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))} is VALID [2022-02-21 04:35:25,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {371#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset, cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcmp_#res#1;havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, cstrcmp_#t~mem6#1, cstrcmp_#t~mem3#1, cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, cstrcmp_#t~mem4#1, cstrcmp_#t~mem8#1, cstrcmp_#t~pre7#1.base, cstrcmp_#t~pre7#1.offset, cstrcmp_#t~mem9#1, cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset; {372#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s1#1.base|) 0) 0) (= |ULTIMATE.start_cstrcmp_~s1#1.offset| 0))} is VALID [2022-02-21 04:35:25,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {372#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s1#1.base|) 0) 0) (= |ULTIMATE.start_cstrcmp_~s1#1.offset| 0))} call cstrcmp_#t~mem3#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post2#1.base, 1 + cstrcmp_#t~post2#1.offset;call cstrcmp_#t~mem4#1 := read~int(cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, 1); {372#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s1#1.base|) 0) 0) (= |ULTIMATE.start_cstrcmp_~s1#1.offset| 0))} is VALID [2022-02-21 04:35:25,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {372#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s1#1.base|) 0) 0) (= |ULTIMATE.start_cstrcmp_~s1#1.offset| 0))} assume !!(cstrcmp_#t~mem3#1 == cstrcmp_#t~mem4#1);havoc cstrcmp_#t~mem3#1;havoc cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset;havoc cstrcmp_#t~mem4#1;cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post5#1.base, 1 + cstrcmp_#t~post5#1.offset;call cstrcmp_#t~mem6#1 := read~int(cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, 1); {373#(= |ULTIMATE.start_cstrcmp_#t~mem6#1| 0)} is VALID [2022-02-21 04:35:25,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {373#(= |ULTIMATE.start_cstrcmp_#t~mem6#1| 0)} assume !(0 == cstrcmp_#t~mem6#1);havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset;havoc cstrcmp_#t~mem6#1; {368#false} is VALID [2022-02-21 04:35:25,462 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 04:35:25,462 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:25,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570881902] [2022-02-21 04:35:25,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570881902] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:25,463 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:25,463 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 04:35:25,463 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536105242] [2022-02-21 04:35:25,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:25,552 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:25,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 04:35:25,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-21 04:35:25,554 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:25,666 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-21 04:35:25,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 04:35:25,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:25,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2022-02-21 04:35:25,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:25,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 17 states and 22 transitions. [2022-02-21 04:35:25,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 04:35:25,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 04:35:25,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2022-02-21 04:35:25,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:25,681 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-02-21 04:35:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2022-02-21 04:35:25,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-02-21 04:35:25,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:25,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 22 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,682 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 22 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,682 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:25,683 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2022-02-21 04:35:25,683 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-02-21 04:35:25,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:25,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:25,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states and 22 transitions. [2022-02-21 04:35:25,683 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states and 22 transitions. [2022-02-21 04:35:25,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:25,684 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2022-02-21 04:35:25,684 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-02-21 04:35:25,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:25,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:25,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:25,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:25,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2022-02-21 04:35:25,684 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-02-21 04:35:25,684 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-02-21 04:35:25,685 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:35:25,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2022-02-21 04:35:25,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:25,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:25,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:25,685 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:25,685 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:25,685 INFO L791 eck$LassoCheckResult]: Stem: 405#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 406#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 415#L524 assume !(main_~length1~0#1 < 1); 417#L524-2 assume !(main_~length2~0#1 < 1); 407#L527-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 408#L533-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 403#L533-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 404#L533-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 418#L533-4 main_~i~1#1 := 0; 412#L537-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 409#L537-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset, cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcmp_#res#1;havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, cstrcmp_#t~mem6#1, cstrcmp_#t~mem3#1, cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, cstrcmp_#t~mem4#1, cstrcmp_#t~mem8#1, cstrcmp_#t~pre7#1.base, cstrcmp_#t~pre7#1.offset, cstrcmp_#t~mem9#1, cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset; 410#L516-3 [2022-02-21 04:35:25,685 INFO L793 eck$LassoCheckResult]: Loop: 410#L516-3 call cstrcmp_#t~mem3#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post2#1.base, 1 + cstrcmp_#t~post2#1.offset;call cstrcmp_#t~mem4#1 := read~int(cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, 1); 411#L516-1 assume !!(cstrcmp_#t~mem3#1 == cstrcmp_#t~mem4#1);havoc cstrcmp_#t~mem3#1;havoc cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset;havoc cstrcmp_#t~mem4#1;cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post5#1.base, 1 + cstrcmp_#t~post5#1.offset;call cstrcmp_#t~mem6#1 := read~int(cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, 1); 416#L517 assume !(0 == cstrcmp_#t~mem6#1);havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset;havoc cstrcmp_#t~mem6#1; 410#L516-3 [2022-02-21 04:35:25,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:25,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2022-02-21 04:35:25,686 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:25,686 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919704168] [2022-02-21 04:35:25,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:25,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:25,718 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:25,726 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:25,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:25,727 INFO L85 PathProgramCache]: Analyzing trace with hash 77620, now seen corresponding path program 2 times [2022-02-21 04:35:25,727 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:25,727 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565083301] [2022-02-21 04:35:25,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:25,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:25,732 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:25,736 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:25,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:25,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1311502365, now seen corresponding path program 1 times [2022-02-21 04:35:25,736 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:25,736 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162498694] [2022-02-21 04:35:25,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:25,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:25,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:25,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {460#true} is VALID [2022-02-21 04:35:25,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {460#true} is VALID [2022-02-21 04:35:25,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} assume !(main_~length1~0#1 < 1); {460#true} is VALID [2022-02-21 04:35:25,904 INFO L290 TraceCheckUtils]: 3: Hoare triple {460#true} assume !(main_~length2~0#1 < 1); {462#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} is VALID [2022-02-21 04:35:25,904 INFO L290 TraceCheckUtils]: 4: Hoare triple {462#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {463#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)) (or (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0)))} is VALID [2022-02-21 04:35:25,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {463#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)) (or (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0)))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {463#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)) (or (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0)))} is VALID [2022-02-21 04:35:25,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {463#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)) (or (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0)))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {463#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)) (or (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0)))} is VALID [2022-02-21 04:35:25,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)) (or (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0)))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {463#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)) (or (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0)))} is VALID [2022-02-21 04:35:25,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {463#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)) (or (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0)))} main_~i~1#1 := 0; {464#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (or (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0)))} is VALID [2022-02-21 04:35:25,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {464#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (or (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0)))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {465#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~length2~0#1| 1) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:25,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {465#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~length2~0#1| 1) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset, cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcmp_#res#1;havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, cstrcmp_#t~mem6#1, cstrcmp_#t~mem3#1, cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, cstrcmp_#t~mem4#1, cstrcmp_#t~mem8#1, cstrcmp_#t~pre7#1.base, cstrcmp_#t~pre7#1.offset, cstrcmp_#t~mem9#1, cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset; {466#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s2#1.base|) |ULTIMATE.start_cstrcmp_~s2#1.offset|) 0) (= |ULTIMATE.start_cstrcmp_~s1#1.offset| 0))} is VALID [2022-02-21 04:35:25,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {466#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s2#1.base|) |ULTIMATE.start_cstrcmp_~s2#1.offset|) 0) (= |ULTIMATE.start_cstrcmp_~s1#1.offset| 0))} call cstrcmp_#t~mem3#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post2#1.base, 1 + cstrcmp_#t~post2#1.offset;call cstrcmp_#t~mem4#1 := read~int(cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, 1); {467#(and (= |ULTIMATE.start_cstrcmp_#t~mem4#1| 0) (= |ULTIMATE.start_cstrcmp_#t~mem3#1| (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s1#1.base|) |ULTIMATE.start_cstrcmp_~s1#1.offset|)) (= |ULTIMATE.start_cstrcmp_~s1#1.offset| 0))} is VALID [2022-02-21 04:35:25,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {467#(and (= |ULTIMATE.start_cstrcmp_#t~mem4#1| 0) (= |ULTIMATE.start_cstrcmp_#t~mem3#1| (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s1#1.base|) |ULTIMATE.start_cstrcmp_~s1#1.offset|)) (= |ULTIMATE.start_cstrcmp_~s1#1.offset| 0))} assume !!(cstrcmp_#t~mem3#1 == cstrcmp_#t~mem4#1);havoc cstrcmp_#t~mem3#1;havoc cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset;havoc cstrcmp_#t~mem4#1;cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post5#1.base, 1 + cstrcmp_#t~post5#1.offset;call cstrcmp_#t~mem6#1 := read~int(cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, 1); {468#(= |ULTIMATE.start_cstrcmp_#t~mem6#1| 0)} is VALID [2022-02-21 04:35:25,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {468#(= |ULTIMATE.start_cstrcmp_#t~mem6#1| 0)} assume !(0 == cstrcmp_#t~mem6#1);havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset;havoc cstrcmp_#t~mem6#1; {461#false} is VALID [2022-02-21 04:35:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:35:25,911 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:25,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162498694] [2022-02-21 04:35:25,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162498694] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:25,911 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:25,911 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-21 04:35:25,911 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694629315] [2022-02-21 04:35:25,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:26,028 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:26,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 04:35:26,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-21 04:35:26,029 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:26,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:26,187 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-21 04:35:26,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 04:35:26,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:26,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:26,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2022-02-21 04:35:26,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:26,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 21 transitions. [2022-02-21 04:35:26,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 04:35:26,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 04:35:26,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2022-02-21 04:35:26,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:26,204 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-02-21 04:35:26,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2022-02-21 04:35:26,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-02-21 04:35:26,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:26,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 21 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:26,204 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 21 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:26,204 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:26,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:26,205 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-02-21 04:35:26,205 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-02-21 04:35:26,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:26,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:26,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states and 21 transitions. [2022-02-21 04:35:26,205 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states and 21 transitions. [2022-02-21 04:35:26,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:26,206 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-02-21 04:35:26,206 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-02-21 04:35:26,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:26,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:26,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:26,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:26,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:26,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-02-21 04:35:26,207 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-02-21 04:35:26,207 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-02-21 04:35:26,207 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:35:26,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2022-02-21 04:35:26,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:26,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:26,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:26,207 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:26,208 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:26,208 INFO L791 eck$LassoCheckResult]: Stem: 498#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 499#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 508#L524 assume !(main_~length1~0#1 < 1); 510#L524-2 assume !(main_~length2~0#1 < 1); 500#L527-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 501#L533-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 496#L533-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 497#L533-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 511#L533-4 main_~i~1#1 := 0; 505#L537-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 506#L537-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 507#L537-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 502#L537-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset, cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcmp_#res#1;havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, cstrcmp_#t~mem6#1, cstrcmp_#t~mem3#1, cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, cstrcmp_#t~mem4#1, cstrcmp_#t~mem8#1, cstrcmp_#t~pre7#1.base, cstrcmp_#t~pre7#1.offset, cstrcmp_#t~mem9#1, cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset; 503#L516-3 [2022-02-21 04:35:26,208 INFO L793 eck$LassoCheckResult]: Loop: 503#L516-3 call cstrcmp_#t~mem3#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post2#1.base, 1 + cstrcmp_#t~post2#1.offset;call cstrcmp_#t~mem4#1 := read~int(cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, 1); 504#L516-1 assume !!(cstrcmp_#t~mem3#1 == cstrcmp_#t~mem4#1);havoc cstrcmp_#t~mem3#1;havoc cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset;havoc cstrcmp_#t~mem4#1;cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post5#1.base, 1 + cstrcmp_#t~post5#1.offset;call cstrcmp_#t~mem6#1 := read~int(cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, 1); 509#L517 assume !(0 == cstrcmp_#t~mem6#1);havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset;havoc cstrcmp_#t~mem6#1; 503#L516-3 [2022-02-21 04:35:26,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:26,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2022-02-21 04:35:26,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:26,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276128557] [2022-02-21 04:35:26,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:26,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:26,227 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:26,235 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:26,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:26,236 INFO L85 PathProgramCache]: Analyzing trace with hash 77620, now seen corresponding path program 3 times [2022-02-21 04:35:26,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:26,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090818194] [2022-02-21 04:35:26,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:26,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:26,241 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:26,244 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:26,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:26,244 INFO L85 PathProgramCache]: Analyzing trace with hash -718433093, now seen corresponding path program 1 times [2022-02-21 04:35:26,244 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:26,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804546374] [2022-02-21 04:35:26,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:26,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:26,263 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:26,275 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:27,122 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:27,122 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:27,122 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:27,122 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:27,122 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:27,122 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:27,122 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:27,122 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:27,122 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcmp-alloca-1.i_Iteration5_Lasso [2022-02-21 04:35:27,122 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:27,122 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:27,125 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 04:35:27,128 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 04:35:27,130 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 04:35:27,133 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 04:35:27,135 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 04:35:27,137 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 04:35:27,139 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 04:35:27,141 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 04:35:27,144 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 04:35:27,146 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 04:35:27,149 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 04:35:27,151 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 04:35:27,154 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 04:35:27,156 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 04:35:27,835 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 04:35:27,837 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 04:35:27,850 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 04:35:27,852 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 04:35:27,853 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 04:35:27,855 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 04:35:27,856 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 04:35:27,857 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 04:35:27,859 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 04:35:27,860 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 04:35:27,861 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 04:35:27,863 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 04:35:27,865 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 04:35:27,866 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 04:35:28,610 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:28,611 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:28,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:28,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:28,613 INFO L229 MonitoredProcess]: Starting monitored process 26 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 04:35:28,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 04:35:28,617 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 04:35:28,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:28,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:28,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:28,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:28,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:28,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:28,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:28,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:28,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:28,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:28,668 INFO L229 MonitoredProcess]: Starting monitored process 27 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 04:35:28,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 04:35:28,671 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 04:35:28,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:28,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:28,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:28,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:28,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:28,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:28,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:28,686 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:28,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 04:35:28,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:28,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:28,704 INFO L229 MonitoredProcess]: Starting monitored process 28 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 04:35:28,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 04:35:28,707 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 04:35:28,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:28,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:28,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:28,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:28,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:28,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:28,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:28,742 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:28,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:28,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:28,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:28,773 INFO L229 MonitoredProcess]: Starting monitored process 29 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 04:35:28,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 04:35:28,776 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 04:35:28,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:28,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:28,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:28,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:28,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:28,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:28,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:28,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:28,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 04:35:28,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:28,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:28,802 INFO L229 MonitoredProcess]: Starting monitored process 30 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 04:35:28,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 04:35:28,805 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 04:35:28,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:28,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:28,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:28,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:28,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:28,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:28,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:28,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:28,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 04:35:28,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:28,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:28,844 INFO L229 MonitoredProcess]: Starting monitored process 31 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 04:35:28,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 04:35:28,852 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 04:35:28,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:28,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:28,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:28,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:28,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:28,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:28,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:28,870 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:28,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:28,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:28,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:28,898 INFO L229 MonitoredProcess]: Starting monitored process 32 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 04:35:28,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 04:35:28,900 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 04:35:28,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:28,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:28,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:28,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:28,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:28,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:28,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:28,921 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:28,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-02-21 04:35:28,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:28,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:28,938 INFO L229 MonitoredProcess]: Starting monitored process 33 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 04:35:28,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 04:35:28,941 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 04:35:28,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:28,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:28,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:28,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:28,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:28,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:28,949 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:28,957 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:28,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-02-21 04:35:28,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:28,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:28,984 INFO L229 MonitoredProcess]: Starting monitored process 34 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 04:35:28,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 04:35:28,985 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 04:35:28,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:28,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:28,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:28,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:28,996 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:28,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:28,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:29,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:29,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:29,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:29,025 INFO L229 MonitoredProcess]: Starting monitored process 35 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 04:35:29,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 04:35:29,028 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 04:35:29,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:29,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:29,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:29,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:29,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:29,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:29,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:29,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:29,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:29,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:29,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:29,062 INFO L229 MonitoredProcess]: Starting monitored process 36 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 04:35:29,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 04:35:29,065 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 04:35:29,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:29,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:29,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:29,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:29,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:29,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:29,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:29,073 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:29,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:29,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:29,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:29,091 INFO L229 MonitoredProcess]: Starting monitored process 37 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 04:35:29,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 04:35:29,094 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 04:35:29,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:29,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:29,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:29,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:29,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:29,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:29,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:29,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:29,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:29,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:29,143 INFO L229 MonitoredProcess]: Starting monitored process 38 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 04:35:29,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 04:35:29,146 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 04:35:29,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:29,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:29,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:29,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:29,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:29,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:29,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:29,156 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:29,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-02-21 04:35:29,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:29,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:29,182 INFO L229 MonitoredProcess]: Starting monitored process 39 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 04:35:29,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 04:35:29,184 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 04:35:29,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:29,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:29,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:29,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:29,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:29,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:29,200 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:29,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:29,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:29,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:29,227 INFO L229 MonitoredProcess]: Starting monitored process 40 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 04:35:29,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 04:35:29,231 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 04:35:29,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:29,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:29,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:29,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:29,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:29,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:29,315 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:29,383 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2022-02-21 04:35:29,383 INFO L444 ModelExtractionUtils]: 15 out of 52 variables were initially zero. Simplification set additionally 34 variables to zero. [2022-02-21 04:35:29,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:29,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:29,385 INFO L229 MonitoredProcess]: Starting monitored process 41 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 04:35:29,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 04:35:29,388 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:29,409 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:29,409 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:29,409 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s2#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_3) = -1*ULTIMATE.start_cstrcmp_~s2#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_3 Supporting invariants [] [2022-02-21 04:35:29,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:29,528 INFO L297 tatePredicateManager]: 24 out of 26 supporting invariants were superfluous and have been removed [2022-02-21 04:35:29,535 INFO L390 LassoCheck]: Loop: "call cstrcmp_#t~mem3#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post2#1.base, 1 + cstrcmp_#t~post2#1.offset;call cstrcmp_#t~mem4#1 := read~int(cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, 1);" "assume !!(cstrcmp_#t~mem3#1 == cstrcmp_#t~mem4#1);havoc cstrcmp_#t~mem3#1;havoc cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset;havoc cstrcmp_#t~mem4#1;cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post5#1.base, 1 + cstrcmp_#t~post5#1.offset;call cstrcmp_#t~mem6#1 := read~int(cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, 1);" "assume !(0 == cstrcmp_#t~mem6#1);havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset;havoc cstrcmp_#t~mem6#1;" [2022-02-21 04:35:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:29,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:29,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 04:35:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:29,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:29,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {555#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {555#unseeded} is VALID [2022-02-21 04:35:29,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {555#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {555#unseeded} is VALID [2022-02-21 04:35:29,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {555#unseeded} assume !(main_~length1~0#1 < 1); {555#unseeded} is VALID [2022-02-21 04:35:29,702 INFO L290 TraceCheckUtils]: 3: Hoare triple {555#unseeded} assume !(main_~length2~0#1 < 1); {555#unseeded} is VALID [2022-02-21 04:35:29,703 INFO L290 TraceCheckUtils]: 4: Hoare triple {555#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {721#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:29,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {721#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {721#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:29,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {721#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {721#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:29,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {721#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {721#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:29,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {721#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} main_~i~1#1 := 0; {721#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:29,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {721#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; {721#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:29,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {721#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {721#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:29,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {721#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {721#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:29,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {721#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset, cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcmp_#res#1;havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, cstrcmp_#t~mem6#1, cstrcmp_#t~mem3#1, cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, cstrcmp_#t~mem4#1, cstrcmp_#t~mem8#1, cstrcmp_#t~pre7#1.base, cstrcmp_#t~pre7#1.offset, cstrcmp_#t~mem9#1, cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset; {700#(and unseeded (= |ULTIMATE.start_cstrcmp_~s2#1.offset| |ULTIMATE.start_cstrcmp_~s1#1.offset|) (= |ULTIMATE.start_cstrcmp_~s1#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} is VALID [2022-02-21 04:35:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:29,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-21 04:35:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:29,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:29,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {701#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) (* (- 1) |ULTIMATE.start_cstrcmp_~s2#1.offset|))) (= |ULTIMATE.start_cstrcmp_~s2#1.offset| |ULTIMATE.start_cstrcmp_~s1#1.offset|) (= |ULTIMATE.start_cstrcmp_~s1#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} call cstrcmp_#t~mem3#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post2#1.base, 1 + cstrcmp_#t~post2#1.offset;call cstrcmp_#t~mem4#1 := read~int(cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, 1); {746#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 1) (+ oldRank0 |ULTIMATE.start_cstrcmp_~s2#1.offset|)) (<= (+ |ULTIMATE.start_cstrcmp_~s1#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcmp_~s1#1.base|)) (= |ULTIMATE.start_cstrcmp_~s1#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= (+ (- 1) |ULTIMATE.start_cstrcmp_~s2#1.offset|) |ULTIMATE.start_cstrcmp_~s1#1.offset|))} is VALID [2022-02-21 04:35:29,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {746#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 1) (+ oldRank0 |ULTIMATE.start_cstrcmp_~s2#1.offset|)) (<= (+ |ULTIMATE.start_cstrcmp_~s1#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcmp_~s1#1.base|)) (= |ULTIMATE.start_cstrcmp_~s1#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= (+ (- 1) |ULTIMATE.start_cstrcmp_~s2#1.offset|) |ULTIMATE.start_cstrcmp_~s1#1.offset|))} assume !!(cstrcmp_#t~mem3#1 == cstrcmp_#t~mem4#1);havoc cstrcmp_#t~mem3#1;havoc cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset;havoc cstrcmp_#t~mem4#1;cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post5#1.base, 1 + cstrcmp_#t~post5#1.offset;call cstrcmp_#t~mem6#1 := read~int(cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, 1); {750#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 1) (+ oldRank0 |ULTIMATE.start_cstrcmp_~s2#1.offset|)) (<= |ULTIMATE.start_cstrcmp_~s2#1.offset| (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|)) (= |ULTIMATE.start_cstrcmp_~s2#1.offset| |ULTIMATE.start_cstrcmp_~s1#1.offset|) (= |ULTIMATE.start_cstrcmp_~s1#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} is VALID [2022-02-21 04:35:29,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {750#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 1) (+ oldRank0 |ULTIMATE.start_cstrcmp_~s2#1.offset|)) (<= |ULTIMATE.start_cstrcmp_~s2#1.offset| (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|)) (= |ULTIMATE.start_cstrcmp_~s2#1.offset| |ULTIMATE.start_cstrcmp_~s1#1.offset|) (= |ULTIMATE.start_cstrcmp_~s1#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} assume !(0 == cstrcmp_#t~mem6#1);havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset;havoc cstrcmp_#t~mem6#1; {703#(and (= |ULTIMATE.start_cstrcmp_~s2#1.offset| |ULTIMATE.start_cstrcmp_~s1#1.offset|) (= |ULTIMATE.start_cstrcmp_~s1#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) (* (- 1) |ULTIMATE.start_cstrcmp_~s2#1.offset|))))))} is VALID [2022-02-21 04:35:29,827 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 04:35:29,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:29,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:29,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:29,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,840 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 04:35:29,840 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:29,890 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19 states and 23 transitions. Complement of second has 5 states. [2022-02-21 04:35:29,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 0 non-accepting loop states 2 accepting loop states [2022-02-21 04:35:29,891 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:29,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. cyclomatic complexity: 7 [2022-02-21 04:35:29,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:29,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:29,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:29,892 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:29,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:29,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2022-02-21 04:35:29,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:29,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:29,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:29,893 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 20 transitions. cyclomatic complexity: 7 [2022-02-21 04:35:29,893 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:35:29,893 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:29,894 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:29,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 16 transitions. cyclomatic complexity: 14 [2022-02-21 04:35:29,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:29,894 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:35:29,894 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 23 transitions. cyclomatic complexity: 7 [2022-02-21 04:35:29,895 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:35:29,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:29,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:29,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:29,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:29,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:29,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:29,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:35:29,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:35:29,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:35:29,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:29,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:29,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:29,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:29,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:29,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:29,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:29,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:29,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:29,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:29,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:29,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:29,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:29,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:29,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:29,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 3 letters. [2022-02-21 04:35:29,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 04:35:29,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 3 letters. [2022-02-21 04:35:29,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:29,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:29,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:29,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:29,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:29,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:29,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,902 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:29,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-02-21 04:35:29,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:29,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,903 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:35:29,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:29,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 04:35:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:29,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:30,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {555#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {555#unseeded} is VALID [2022-02-21 04:35:30,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {555#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {555#unseeded} is VALID [2022-02-21 04:35:30,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {555#unseeded} assume !(main_~length1~0#1 < 1); {555#unseeded} is VALID [2022-02-21 04:35:30,056 INFO L290 TraceCheckUtils]: 3: Hoare triple {555#unseeded} assume !(main_~length2~0#1 < 1); {555#unseeded} is VALID [2022-02-21 04:35:30,057 INFO L290 TraceCheckUtils]: 4: Hoare triple {555#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {802#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:30,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {802#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {802#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:30,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {802#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {802#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:30,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {802#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {802#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:30,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {802#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} main_~i~1#1 := 0; {802#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:30,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {802#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; {802#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:30,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {802#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {802#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:30,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {802#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {802#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:30,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {802#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset, cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcmp_#res#1;havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, cstrcmp_#t~mem6#1, cstrcmp_#t~mem3#1, cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, cstrcmp_#t~mem4#1, cstrcmp_#t~mem8#1, cstrcmp_#t~pre7#1.base, cstrcmp_#t~pre7#1.offset, cstrcmp_#t~mem9#1, cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset; {700#(and unseeded (= |ULTIMATE.start_cstrcmp_~s2#1.offset| |ULTIMATE.start_cstrcmp_~s1#1.offset|) (= |ULTIMATE.start_cstrcmp_~s1#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} is VALID [2022-02-21 04:35:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:30,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-21 04:35:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:30,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:30,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {701#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) (* (- 1) |ULTIMATE.start_cstrcmp_~s2#1.offset|))) (= |ULTIMATE.start_cstrcmp_~s2#1.offset| |ULTIMATE.start_cstrcmp_~s1#1.offset|) (= |ULTIMATE.start_cstrcmp_~s1#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} call cstrcmp_#t~mem3#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post2#1.base, 1 + cstrcmp_#t~post2#1.offset;call cstrcmp_#t~mem4#1 := read~int(cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, 1); {827#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) (+ oldRank0 |ULTIMATE.start_cstrcmp_~s1#1.offset|)) (<= (+ |ULTIMATE.start_cstrcmp_~s1#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcmp_~s1#1.base|)) (= |ULTIMATE.start_cstrcmp_~s1#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= (+ (- 1) |ULTIMATE.start_cstrcmp_~s2#1.offset|) |ULTIMATE.start_cstrcmp_~s1#1.offset|))} is VALID [2022-02-21 04:35:30,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {827#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) (+ oldRank0 |ULTIMATE.start_cstrcmp_~s1#1.offset|)) (<= (+ |ULTIMATE.start_cstrcmp_~s1#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcmp_~s1#1.base|)) (= |ULTIMATE.start_cstrcmp_~s1#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= (+ (- 1) |ULTIMATE.start_cstrcmp_~s2#1.offset|) |ULTIMATE.start_cstrcmp_~s1#1.offset|))} assume !!(cstrcmp_#t~mem3#1 == cstrcmp_#t~mem4#1);havoc cstrcmp_#t~mem3#1;havoc cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset;havoc cstrcmp_#t~mem4#1;cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post5#1.base, 1 + cstrcmp_#t~post5#1.offset;call cstrcmp_#t~mem6#1 := read~int(cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, 1); {831#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 1) (+ oldRank0 |ULTIMATE.start_cstrcmp_~s2#1.offset|)) (<= |ULTIMATE.start_cstrcmp_~s2#1.offset| (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|)) (= |ULTIMATE.start_cstrcmp_~s2#1.offset| |ULTIMATE.start_cstrcmp_~s1#1.offset|) (= |ULTIMATE.start_cstrcmp_~s1#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} is VALID [2022-02-21 04:35:30,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {831#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 1) (+ oldRank0 |ULTIMATE.start_cstrcmp_~s2#1.offset|)) (<= |ULTIMATE.start_cstrcmp_~s2#1.offset| (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|)) (= |ULTIMATE.start_cstrcmp_~s2#1.offset| |ULTIMATE.start_cstrcmp_~s1#1.offset|) (= |ULTIMATE.start_cstrcmp_~s1#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} assume !(0 == cstrcmp_#t~mem6#1);havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset;havoc cstrcmp_#t~mem6#1; {703#(and (= |ULTIMATE.start_cstrcmp_~s2#1.offset| |ULTIMATE.start_cstrcmp_~s1#1.offset|) (= |ULTIMATE.start_cstrcmp_~s1#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) (* (- 1) |ULTIMATE.start_cstrcmp_~s2#1.offset|))))))} is VALID [2022-02-21 04:35:30,154 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 04:35:30,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:30,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:30,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:30,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,167 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 04:35:30,168 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:30,221 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19 states and 24 transitions. Complement of second has 7 states. [2022-02-21 04:35:30,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:30,222 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:30,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. cyclomatic complexity: 7 [2022-02-21 04:35:30,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:30,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:30,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:30,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:30,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:30,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:30,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2022-02-21 04:35:30,223 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:30,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:30,223 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 20 transitions. cyclomatic complexity: 7 [2022-02-21 04:35:30,223 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:35:30,229 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:30,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:30,231 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:30,231 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 24 transitions. cyclomatic complexity: 8 [2022-02-21 04:35:30,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. cyclomatic complexity: 8 [2022-02-21 04:35:30,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:30,231 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:35:30,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:30,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:30,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:30,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 3 letters. [2022-02-21 04:35:30,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 04:35:30,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 3 letters. [2022-02-21 04:35:30,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:35:30,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:35:30,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:35:30,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:30,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:30,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:30,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:30,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:30,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:30,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:30,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:30,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:30,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:30,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:30,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:30,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:30,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:30,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:30,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 3 letters. [2022-02-21 04:35:30,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 04:35:30,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 3 letters. [2022-02-21 04:35:30,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,239 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:30,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-02-21 04:35:30,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:30,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:30,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 13 letters. Loop has 6 letters. [2022-02-21 04:35:30,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:30,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. cyclomatic complexity: 8 [2022-02-21 04:35:30,243 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:30,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2022-02-21 04:35:30,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:35:30,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:35:30,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:35:30,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:30,244 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:30,244 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:30,244 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:30,244 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:35:30,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:35:30,244 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:30,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:30,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:35:30 BoogieIcfgContainer [2022-02-21 04:35:30,254 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:35:30,255 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:35:30,255 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:35:30,255 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:35:30,255 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:21" (3/4) ... [2022-02-21 04:35:30,257 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:35:30,257 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:35:30,258 INFO L158 Benchmark]: Toolchain (without parser) took 10163.03ms. Allocated memory was 113.2MB in the beginning and 195.0MB in the end (delta: 81.8MB). Free memory was 82.5MB in the beginning and 62.5MB in the end (delta: 20.0MB). Peak memory consumption was 100.3MB. Max. memory is 16.1GB. [2022-02-21 04:35:30,259 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 79.7MB. Free memory is still 34.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:30,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.23ms. Allocated memory is still 113.2MB. Free memory was 82.2MB in the beginning and 79.8MB in the end (delta: 2.4MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-02-21 04:35:30,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.62ms. Allocated memory is still 113.2MB. Free memory was 79.8MB in the beginning and 77.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:30,260 INFO L158 Benchmark]: Boogie Preprocessor took 43.92ms. Allocated memory is still 113.2MB. Free memory was 77.8MB in the beginning and 76.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:30,260 INFO L158 Benchmark]: RCFGBuilder took 612.97ms. Allocated memory is still 113.2MB. Free memory was 76.0MB in the beginning and 61.2MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 04:35:30,260 INFO L158 Benchmark]: BuchiAutomizer took 9056.06ms. Allocated memory was 113.2MB in the beginning and 195.0MB in the end (delta: 81.8MB). Free memory was 61.2MB in the beginning and 62.5MB in the end (delta: -1.3MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. [2022-02-21 04:35:30,260 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 195.0MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:30,261 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.21ms. Allocated memory is still 79.7MB. Free memory is still 34.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.23ms. Allocated memory is still 113.2MB. Free memory was 82.2MB in the beginning and 79.8MB in the end (delta: 2.4MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.62ms. Allocated memory is still 113.2MB. Free memory was 79.8MB in the beginning and 77.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.92ms. Allocated memory is still 113.2MB. Free memory was 77.8MB in the beginning and 76.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 612.97ms. Allocated memory is still 113.2MB. Free memory was 76.0MB in the beginning and 61.2MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 9056.06ms. Allocated memory was 113.2MB in the beginning and 195.0MB in the end (delta: 81.8MB). Free memory was 61.2MB in the beginning and 62.5MB in the end (delta: -1.3MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 195.0MB. Free memory is still 62.5MB. 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 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function length2 + -1 * i and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * s2 and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.9s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 7.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 2. Nontrivial modules had stage [2, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 126 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 126 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 128 IncrementalHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 72 mSDtfsCounter, 128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital201 mio100 ax111 hnf100 lsp84 ukn75 mio100 lsp48 div100 bol100 ite100 ukn100 eq179 hnf90 smp97 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 2 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 04:35:30,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:30,506 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