./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4b11c9964533b446d4a410c2e05b424a11d24fa8de6ca154a41c04142b1e6007 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:35:19,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:35:19,850 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:35:19,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:35:19,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:35:19,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:35:19,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:35:19,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:35:19,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:35:19,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:35:19,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:35:19,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:35:19,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:35:19,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:35:19,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:35:19,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:35:19,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:35:19,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:35:19,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:35:19,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:35:19,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:35:19,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:35:19,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:35:19,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:35:19,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:35:19,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:35:19,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:35:19,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:35:19,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:35:19,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:35:19,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:35:19,918 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:35:19,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:35:19,919 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:35:19,920 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:35:19,920 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:35:19,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:35:19,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:35:19,921 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:35:19,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:35:19,922 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:35:19,923 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:35:19,950 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:35:19,950 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:35:19,951 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:35:19,951 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:35:19,952 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:35:19,952 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:35:19,952 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:35:19,952 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:35:19,952 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:35:19,953 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:35:19,953 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:35:19,953 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:35:19,953 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:35:19,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:35:19,954 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:35:19,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:35:19,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:35:19,954 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:35:19,954 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:35:19,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:35:19,955 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:35:19,955 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:35:19,955 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:35:19,955 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:35:19,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:35:19,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:35:19,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:35:19,956 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:35:19,957 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:35:19,957 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b11c9964533b446d4a410c2e05b424a11d24fa8de6ca154a41c04142b1e6007 [2022-02-21 03:35:20,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:35:20,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:35:20,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:35:20,163 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:35:20,164 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:35:20,165 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca.i [2022-02-21 03:35:20,231 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc478c27f/6aaf5ec83ae04a7a8cef6a79d233dc8a/FLAG3e2ab7b6f [2022-02-21 03:35:20,682 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:35:20,698 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca.i [2022-02-21 03:35:20,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc478c27f/6aaf5ec83ae04a7a8cef6a79d233dc8a/FLAG3e2ab7b6f [2022-02-21 03:35:21,204 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc478c27f/6aaf5ec83ae04a7a8cef6a79d233dc8a [2022-02-21 03:35:21,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:35:21,208 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:35:21,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:21,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:35:21,218 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:35:21,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:21" (1/1) ... [2022-02-21 03:35:21,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d57d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21, skipping insertion in model container [2022-02-21 03:35:21,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:21" (1/1) ... [2022-02-21 03:35:21,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:35:21,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:35:21,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:21,544 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:35:21,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:21,635 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:35:21,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21 WrapperNode [2022-02-21 03:35:21,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:21,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:21,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:35:21,638 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:35:21,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21" (1/1) ... [2022-02-21 03:35:21,666 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21" (1/1) ... [2022-02-21 03:35:21,693 INFO L137 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2022-02-21 03:35:21,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:21,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:35:21,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:35:21,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:35:21,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21" (1/1) ... [2022-02-21 03:35:21,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21" (1/1) ... [2022-02-21 03:35:21,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21" (1/1) ... [2022-02-21 03:35:21,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21" (1/1) ... [2022-02-21 03:35:21,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21" (1/1) ... [2022-02-21 03:35:21,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21" (1/1) ... [2022-02-21 03:35:21,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21" (1/1) ... [2022-02-21 03:35:21,730 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:35:21,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:35:21,731 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:35:21,731 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:35:21,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21" (1/1) ... [2022-02-21 03:35:21,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:21,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:21,797 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:21,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:35:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:35:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:35:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:35:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:35:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:35:21,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:35:21,925 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:35:21,926 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:35:22,113 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:35:22,118 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:35:22,118 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:35:22,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:22 BoogieIcfgContainer [2022-02-21 03:35:22,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:35:22,121 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:35:22,121 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:35:22,124 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:35:22,130 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:22,131 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:35:21" (1/3) ... [2022-02-21 03:35:22,132 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7afc38b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:22, skipping insertion in model container [2022-02-21 03:35:22,132 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:22,132 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21" (2/3) ... [2022-02-21 03:35:22,132 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7afc38b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:22, skipping insertion in model container [2022-02-21 03:35:22,132 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:22,147 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:22" (3/3) ... [2022-02-21 03:35:22,148 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_diffterm_alloca.i [2022-02-21 03:35:22,185 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:35:22,186 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:35:22,186 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:35:22,186 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:35:22,186 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:35:22,186 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:35:22,187 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:35:22,187 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:35:22,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 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 03:35:22,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:22,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:22,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:22,242 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:22,242 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:35:22,242 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:35:22,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 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 03:35:22,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:22,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:22,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:22,252 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:22,252 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:35:22,259 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; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, 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~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 17#L382true assume !(main_~length1~0#1 < 1); 15#L382-2true assume !(main_~length2~0#1 < 1); 6#L385-1true call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(49, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(49, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#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 cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 10#L369-4true [2022-02-21 03:35:22,261 INFO L793 eck$LassoCheckResult]: Loop: 10#L369-4true call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 16#L369-1true assume !!(49 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; 8#L372-5true assume !true; 7#L372-6true call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 18#L374true assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; 11#L369-3true cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; 10#L369-4true [2022-02-21 03:35:22,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:22,271 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 03:35:22,279 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:22,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448654557] [2022-02-21 03:35:22,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:22,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,460 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,521 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:22,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:22,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2022-02-21 03:35:22,525 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:22,525 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616217536] [2022-02-21 03:35:22,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:22,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:22,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#true} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {24#true} is VALID [2022-02-21 03:35:22,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume !!(49 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {24#true} is VALID [2022-02-21 03:35:22,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-02-21 03:35:22,607 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#false} call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); {25#false} is VALID [2022-02-21 03:35:22,607 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#false} assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; {25#false} is VALID [2022-02-21 03:35:22,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#false} cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; {25#false} is VALID [2022-02-21 03:35:22,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:22,611 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:22,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616217536] [2022-02-21 03:35:22,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616217536] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:22,612 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:22,612 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:35:22,612 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885969099] [2022-02-21 03:35:22,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:22,618 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:35:22,619 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:22,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:35:22,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:35:22,647 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 03:35:22,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:22,675 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-02-21 03:35:22,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:35:22,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 03:35:22,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:22,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2022-02-21 03:35:22,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:22,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2022-02-21 03:35:22,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 03:35:22,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 03:35:22,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2022-02-21 03:35:22,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:22,703 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:35:22,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2022-02-21 03:35:22,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 03:35:22,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:22,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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 03:35:22,721 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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 03:35:22,722 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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 03:35:22,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:22,729 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:35:22,730 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:35:22,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:22,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:22,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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 13 states and 17 transitions. [2022-02-21 03:35:22,732 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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 13 states and 17 transitions. [2022-02-21 03:35:22,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:22,734 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:35:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:35:22,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:22,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:22,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:22,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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 03:35:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2022-02-21 03:35:22,737 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:35:22,738 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:35:22,739 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:35:22,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:35:22,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:22,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:22,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:22,742 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:22,743 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:22,743 INFO L791 eck$LassoCheckResult]: Stem: 44#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 45#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, 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~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 52#L382 assume !(main_~length1~0#1 < 1); 56#L382-2 assume !(main_~length2~0#1 < 1); 46#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(49, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(49, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#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 cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 47#L369-4 [2022-02-21 03:35:22,744 INFO L793 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 53#L369-1 assume !!(49 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; 50#L372-5 call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 49 != cstrpbrk_#t~mem208#1; 51#L372-1 assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 55#L372-3 assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; 48#L372-6 call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 49#L374 assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; 54#L369-3 cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; 47#L369-4 [2022-02-21 03:35:22,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:22,746 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2022-02-21 03:35:22,750 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:22,750 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435248720] [2022-02-21 03:35:22,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:22,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,779 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,807 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:22,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:22,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2022-02-21 03:35:22,808 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:22,808 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701389113] [2022-02-21 03:35:22,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:22,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,830 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,841 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:22,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:22,844 INFO L85 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2022-02-21 03:35:22,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:22,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148692895] [2022-02-21 03:35:22,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:22,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,905 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,930 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:23,827 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:23,828 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:23,828 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:23,828 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:23,828 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:23,829 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,829 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:23,829 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:23,829 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_diffterm_alloca.i_Iteration2_Lasso [2022-02-21 03:35:23,829 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:23,829 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:23,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:25,135 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:25,138 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:25,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,141 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:25,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:35:25,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:25,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,170 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:25,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:25,184 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:35:25,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,203 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:25,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:35:25,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:25,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:25,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:25,226 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:25,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,244 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:25,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:35:25,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:25,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:25,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:25,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:25,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,281 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:25,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:35:25,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:25,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,298 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:25,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:25,312 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:25,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,332 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:25,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:25,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:25,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:25,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:35:25,358 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:25,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,380 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:25,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:35:25,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:25,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:25,395 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:25,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:25,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,437 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:25,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:35:25,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:25,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:25,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,447 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2022-02-21 03:35:25,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:25,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:25,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 03:35:25,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,473 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 03:35:25,474 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 03:35:25,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:25,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:25,487 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:25,511 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:25,532 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-02-21 03:35:25,532 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-02-21 03:35:25,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,550 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 03:35:25,604 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:25,607 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 03:35:25,637 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:25,637 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:25,637 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc215#1.base)_1, ULTIMATE.start_cstrpbrk_~sc1~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215#1.base)_1 - 1*ULTIMATE.start_cstrpbrk_~sc1~0#1.offset Supporting invariants [] [2022-02-21 03:35:25,663 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 03:35:25,703 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2022-02-21 03:35:25,712 INFO L390 LassoCheck]: Loop: "call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);" "assume !!(49 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1;" "call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 49 != cstrpbrk_#t~mem208#1;" "assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256);" "assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;" "call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);" "assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1;" "cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset;" [2022-02-21 03:35:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:25,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:25,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:35:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:25,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:25,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {92#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {92#unseeded} is VALID [2022-02-21 03:35:25,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {92#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, 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~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {92#unseeded} is VALID [2022-02-21 03:35:25,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {92#unseeded} assume !(main_~length1~0#1 < 1); {92#unseeded} is VALID [2022-02-21 03:35:25,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {92#unseeded} assume !(main_~length2~0#1 < 1); {92#unseeded} is VALID [2022-02-21 03:35:25,795 INFO L290 TraceCheckUtils]: 4: Hoare triple {92#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(49, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(49, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#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 cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; {151#(and (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc215#1.base|) unseeded)} is VALID [2022-02-21 03:35:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:25,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:25,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:25,875 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 03:35:25,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {152#(and (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc215#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))))} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {172#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc215#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))))} is VALID [2022-02-21 03:35:25,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc215#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))))} assume !!(49 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {172#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc215#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))))} is VALID [2022-02-21 03:35:25,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {172#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc215#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))))} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 49 != cstrpbrk_#t~mem208#1; {172#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc215#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))))} is VALID [2022-02-21 03:35:25,972 INFO L290 TraceCheckUtils]: 3: Hoare triple {172#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc215#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))))} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {172#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc215#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))))} is VALID [2022-02-21 03:35:25,972 INFO L290 TraceCheckUtils]: 4: Hoare triple {172#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc215#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))))} assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; {172#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc215#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))))} is VALID [2022-02-21 03:35:25,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {172#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc215#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))))} call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); {172#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc215#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))))} is VALID [2022-02-21 03:35:25,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {172#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc215#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))))} assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; {172#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc215#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))))} is VALID [2022-02-21 03:35:25,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {172#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc215#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))))} cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; {154#(and (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc215#1.base|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))))))} is VALID [2022-02-21 03:35:25,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:25,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 03:35:25,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:25,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 8 letters. [2022-02-21 03:35:25,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,994 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:35:25,995 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 03:35:26,074 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 28 transitions. Complement of second has 4 states. [2022-02-21 03:35:26,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:35:26,075 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:26,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:26,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:26,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:26,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 03:35:26,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:26,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:26,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:26,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2022-02-21 03:35:26,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:26,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:26,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:26,084 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:26,089 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:35:26,090 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 03:35:26,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:26,094 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:26,095 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:26,095 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:26,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:26,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 8 letters. [2022-02-21 03:35:26,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:26,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:26,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 03:35:26,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:26,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:26,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 3 letters. [2022-02-21 03:35:26,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:26,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:35:26,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 03:35:26,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:35:26,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:35:26,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 letters. [2022-02-21 03:35:26,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:35:26,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:35:26,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 3 letters. Loop has 3 letters. [2022-02-21 03:35:26,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:35:26,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 8 letters. [2022-02-21 03:35:26,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 8 letters. [2022-02-21 03:35:26,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 8 letters. [2022-02-21 03:35:26,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:35:26,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 8 letters. [2022-02-21 03:35:26,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:35:26,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:26,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 3 letters. [2022-02-21 03:35:26,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:26,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:26,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 3 letters. [2022-02-21 03:35:26,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:26,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 8 letters. [2022-02-21 03:35:26,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 8 letters. [2022-02-21 03:35:26,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 8 letters. [2022-02-21 03:35:26,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:35:26,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 12 letters. Loop has 8 letters. [2022-02-21 03:35:26,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:35:26,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:26,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 03:35:26,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:26,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:26,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 8 letters. [2022-02-21 03:35:26,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:26,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:26,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 03:35:26,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:26,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:26,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 3 letters. [2022-02-21 03:35:26,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:26,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:26,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 3 letters. [2022-02-21 03:35:26,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:26,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:26,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 03:35:26,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:26,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,114 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:26,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 03:35:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-02-21 03:35:26,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:26,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:35:26,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2022-02-21 03:35:26,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:26,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:26,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2022-02-21 03:35:26,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:35:26,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:35:26,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2022-02-21 03:35:26,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:26,118 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:35:26,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2022-02-21 03:35:26,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-21 03:35:26,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:26,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 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 03:35:26,120 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 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 03:35:26,120 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 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 03:35:26,120 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:26,122 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 03:35:26,122 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:35:26,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:26,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:26,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 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 18 states and 25 transitions. [2022-02-21 03:35:26,123 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 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 18 states and 25 transitions. [2022-02-21 03:35:26,123 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:26,124 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 03:35:26,124 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:35:26,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:26,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:26,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:26,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:26,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 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 03:35:26,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2022-02-21 03:35:26,126 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:35:26,126 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:35:26,126 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:35:26,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:35:26,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:26,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:26,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:26,127 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:26,127 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:26,127 INFO L791 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 223#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, 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~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 232#L382 assume !(main_~length1~0#1 < 1); 239#L382-2 assume !(main_~length2~0#1 < 1); 224#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(49, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(49, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#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 cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 225#L369-4 call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 234#L369-1 assume !!(49 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; 228#L372-5 [2022-02-21 03:35:26,127 INFO L793 eck$LassoCheckResult]: Loop: 228#L372-5 call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 49 != cstrpbrk_#t~mem208#1; 229#L372-1 assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 237#L372-3 assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, 1 + cstrpbrk_#t~post211#1.offset;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset; 228#L372-5 [2022-02-21 03:35:26,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:26,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2022-02-21 03:35:26,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:26,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032637525] [2022-02-21 03:35:26,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:26,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:26,152 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:26,175 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:26,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:26,180 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2022-02-21 03:35:26,180 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:26,180 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159411201] [2022-02-21 03:35:26,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:26,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:26,193 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:26,200 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:26,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:26,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2022-02-21 03:35:26,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:26,201 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132225350] [2022-02-21 03:35:26,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:26,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:26,232 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:26,253 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:26,861 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:26,861 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:26,861 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:26,861 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:26,861 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:26,861 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,861 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:26,861 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:26,861 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_diffterm_alloca.i_Iteration3_Lasso [2022-02-21 03:35:26,861 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:26,861 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:26,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 03:35:26,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:26,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:26,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:26,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:26,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:26,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:26,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:26,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:28,014 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:28,014 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:28,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:28,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:28,015 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 03:35:28,017 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 03:35:28,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:28,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:28,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:28,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:28,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:28,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:28,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:28,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:28,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:28,047 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 03:35:28,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:28,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:28,049 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 03:35:28,050 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 03:35:28,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:28,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:28,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:28,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:28,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:28,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:28,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:28,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:28,065 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:28,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 03:35:28,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:28,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:28,082 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 03:35:28,082 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 03:35:28,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:28,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:28,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:28,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:28,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:28,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:28,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:28,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:28,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:28,130 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 03:35:28,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:28,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:28,131 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 03:35:28,144 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 03:35:28,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:28,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:28,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:28,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:28,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:28,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:28,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:28,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:28,161 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:28,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-02-21 03:35:28,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:28,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:28,189 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 03:35:28,189 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 03:35:28,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:28,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:28,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:28,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:28,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:28,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:28,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:28,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:28,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:28,222 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 03:35:28,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:28,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:28,224 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 03:35:28,224 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 03:35:28,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:28,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:28,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:28,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:28,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:28,233 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:28,233 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:28,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:28,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 03:35:28,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:28,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:28,276 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 03:35:28,277 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 03:35:28,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:28,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:28,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:28,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:28,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:28,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:28,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:28,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:28,314 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:28,331 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 03:35:28,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:28,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:28,334 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 03:35:28,336 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 03:35:28,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:28,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:28,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:28,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:28,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:28,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:28,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:28,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:28,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:28,368 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 03:35:28,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:28,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:28,369 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 03:35:28,370 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 03:35:28,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:28,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:28,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:28,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:28,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:28,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:28,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:28,388 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:28,412 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 03:35:28,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:28,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:28,413 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 03:35:28,416 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 03:35:28,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:28,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:28,424 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-02-21 03:35:28,424 INFO L204 nArgumentSynthesizer]: 7 loop disjuncts [2022-02-21 03:35:28,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:28,483 INFO L401 nArgumentSynthesizer]: We have 140 Motzkin's Theorem applications. [2022-02-21 03:35:28,484 INFO L402 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2022-02-21 03:35:28,605 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:28,623 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 03:35:28,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:28,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:28,624 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 03:35:28,625 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 03:35:28,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:28,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:28,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:28,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:28,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:28,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:28,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:28,638 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:28,662 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 03:35:28,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:28,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:28,664 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 03:35:28,664 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 03:35:28,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:28,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:28,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:28,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:28,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:28,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:28,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:28,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:28,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 03:35:28,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:28,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:28,703 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 03:35:28,704 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 03:35:28,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:28,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:28,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:28,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:28,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:28,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:28,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:28,731 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:28,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 03:35:28,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:28,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:28,747 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 03:35:28,748 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 03:35:28,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:28,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:28,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:28,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:28,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:28,763 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:28,763 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:28,774 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:28,794 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-02-21 03:35:28,794 INFO L444 ModelExtractionUtils]: 33 out of 43 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-02-21 03:35:28,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:28,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:28,799 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 03:35:28,850 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:28,857 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 03:35:28,857 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:28,858 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:28,858 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc216#1.base)_2) = -1*ULTIMATE.start_cstrpbrk_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216#1.base)_2 Supporting invariants [] [2022-02-21 03:35:28,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 03:35:28,936 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2022-02-21 03:35:28,941 INFO L390 LassoCheck]: Loop: "call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 49 != cstrpbrk_#t~mem208#1;" "assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256);" "assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, 1 + cstrpbrk_#t~post211#1.offset;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset;" [2022-02-21 03:35:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:28,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:29,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:35:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:29,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:29,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {329#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {329#unseeded} is VALID [2022-02-21 03:35:29,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {329#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, 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~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {329#unseeded} is VALID [2022-02-21 03:35:29,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {329#unseeded} assume !(main_~length1~0#1 < 1); {329#unseeded} is VALID [2022-02-21 03:35:29,046 INFO L290 TraceCheckUtils]: 3: Hoare triple {329#unseeded} assume !(main_~length2~0#1 < 1); {329#unseeded} is VALID [2022-02-21 03:35:29,047 INFO L290 TraceCheckUtils]: 4: Hoare triple {329#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(49, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(49, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#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 cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; {429#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:29,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {429#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {429#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:29,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {429#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} assume !!(49 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {408#(and (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) unseeded)} is VALID [2022-02-21 03:35:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:29,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:29,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:29,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {409#(and (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|))))} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 49 != cstrpbrk_#t~mem208#1; {436#(and (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|))) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} is VALID [2022-02-21 03:35:29,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {436#(and (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|))) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {436#(and (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|))) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} is VALID [2022-02-21 03:35:29,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {436#(and (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|))) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, 1 + cstrpbrk_#t~post211#1.offset;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset; {411#(and (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|))))))} is VALID [2022-02-21 03:35:29,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:29,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 03:35:29,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:29,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 3 letters. [2022-02-21 03:35:29,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,110 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:35:29,110 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 03:35:29,180 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 43 states and 57 transitions. Complement of second has 6 states. [2022-02-21 03:35:29,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:35:29,180 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:29,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:29,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:29,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:29,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 03:35:29,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:29,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:29,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:29,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 57 transitions. [2022-02-21 03:35:29,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:29,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:29,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:29,183 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:29,183 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:29,183 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 03:35:29,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:29,184 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:29,184 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2022-02-21 03:35:29,185 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:29,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:29,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 3 letters. [2022-02-21 03:35:29,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:29,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:29,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 2 letters. [2022-02-21 03:35:29,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:29,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:29,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 03:35:29,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:29,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 43 letters. Loop has 43 letters. [2022-02-21 03:35:29,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 43 letters. Loop has 43 letters. [2022-02-21 03:35:29,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 43 letters. Loop has 43 letters. [2022-02-21 03:35:29,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:35:29,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 18 letters. [2022-02-21 03:35:29,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:35:29,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:29,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 03:35:29,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:29,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:29,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 3 letters. [2022-02-21 03:35:29,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:29,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:29,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 3 letters. [2022-02-21 03:35:29,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:29,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:29,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 03:35:29,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:29,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:29,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 2 letters. [2022-02-21 03:35:29,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:29,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:29,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 03:35:29,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:29,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:29,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 03:35:29,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:29,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:29,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 03:35:29,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:29,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,199 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:29,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 03:35:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:35:29,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:29,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:35:29,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:35:29,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:29,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2022-02-21 03:35:29,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:29,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2022-02-21 03:35:29,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:35:29,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:35:29,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2022-02-21 03:35:29,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:29,204 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-02-21 03:35:29,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2022-02-21 03:35:29,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-02-21 03:35:29,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:29,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 40 transitions. Second operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 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 03:35:29,206 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 40 transitions. Second operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 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 03:35:29,206 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 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 03:35:29,206 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:29,207 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-21 03:35:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-21 03:35:29,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:29,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:29,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 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 30 states and 40 transitions. [2022-02-21 03:35:29,208 INFO L87 Difference]: Start difference. First operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 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 30 states and 40 transitions. [2022-02-21 03:35:29,208 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:29,209 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-21 03:35:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-21 03:35:29,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:29,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:29,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:29,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:29,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 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 03:35:29,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2022-02-21 03:35:29,211 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-02-21 03:35:29,211 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-02-21 03:35:29,211 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:35:29,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2022-02-21 03:35:29,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:29,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:29,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:29,228 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:29,228 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:29,228 INFO L791 eck$LassoCheckResult]: Stem: 496#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 497#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, 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~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 506#L382 assume !(main_~length1~0#1 < 1); 515#L382-2 assume !(main_~length2~0#1 < 1); 498#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(49, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(49, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#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 cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 499#L369-4 call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 507#L369-1 assume !!(49 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; 516#L372-5 call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 49 != cstrpbrk_#t~mem208#1; 519#L372-1 assume !cstrpbrk_#t~short210#1; 517#L372-3 assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; 500#L372-6 call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 501#L374 assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; 511#L369-3 cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; 508#L369-4 call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 510#L369-1 assume !!(49 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; 502#L372-5 [2022-02-21 03:35:29,231 INFO L793 eck$LassoCheckResult]: Loop: 502#L372-5 call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 49 != cstrpbrk_#t~mem208#1; 503#L372-1 assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 512#L372-3 assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, 1 + cstrpbrk_#t~post211#1.offset;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset; 502#L372-5 [2022-02-21 03:35:29,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:29,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2022-02-21 03:35:29,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:29,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542840017] [2022-02-21 03:35:29,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:29,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:29,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {644#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {644#true} is VALID [2022-02-21 03:35:29,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {644#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, 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~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {644#true} is VALID [2022-02-21 03:35:29,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {644#true} assume !(main_~length1~0#1 < 1); {644#true} is VALID [2022-02-21 03:35:29,309 INFO L290 TraceCheckUtils]: 3: Hoare triple {644#true} assume !(main_~length2~0#1 < 1); {644#true} is VALID [2022-02-21 03:35:29,309 INFO L290 TraceCheckUtils]: 4: Hoare triple {644#true} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(49, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(49, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#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 cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; {644#true} is VALID [2022-02-21 03:35:29,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {644#true} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {646#(= |ULTIMATE.start_cstrpbrk_#t~mem206#1| (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))} is VALID [2022-02-21 03:35:29,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {646#(= |ULTIMATE.start_cstrpbrk_#t~mem206#1| (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))} assume !!(49 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {647#(not (= 49 |ULTIMATE.start_cstrpbrk_~c~0#1|))} is VALID [2022-02-21 03:35:29,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {647#(not (= 49 |ULTIMATE.start_cstrpbrk_~c~0#1|))} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 49 != cstrpbrk_#t~mem208#1; {648#(or (not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|)) |ULTIMATE.start_cstrpbrk_#t~short210#1|)} is VALID [2022-02-21 03:35:29,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {648#(or (not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|)) |ULTIMATE.start_cstrpbrk_#t~short210#1|)} assume !cstrpbrk_#t~short210#1; {649#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|))} is VALID [2022-02-21 03:35:29,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {649#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|))} assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; {649#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|))} is VALID [2022-02-21 03:35:29,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {649#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|))} call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); {650#(not (= |ULTIMATE.start_cstrpbrk_#t~mem212#1| |ULTIMATE.start_cstrpbrk_~c~0#1|))} is VALID [2022-02-21 03:35:29,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {650#(not (= |ULTIMATE.start_cstrpbrk_#t~mem212#1| |ULTIMATE.start_cstrpbrk_~c~0#1|))} assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; {645#false} is VALID [2022-02-21 03:35:29,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {645#false} cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; {645#false} is VALID [2022-02-21 03:35:29,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {645#false} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {645#false} is VALID [2022-02-21 03:35:29,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {645#false} assume !!(49 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {645#false} is VALID [2022-02-21 03:35:29,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:29,314 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:29,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542840017] [2022-02-21 03:35:29,315 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542840017] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:29,315 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:29,316 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 03:35:29,316 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073333272] [2022-02-21 03:35:29,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:29,316 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:35:29,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:29,317 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2022-02-21 03:35:29,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:29,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079994348] [2022-02-21 03:35:29,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:29,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:29,325 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:29,331 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:29,440 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:29,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:35:29,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:35:29,441 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 03:35:29,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:29,603 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-21 03:35:29,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:35:29,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 03:35:29,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:29,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2022-02-21 03:35:29,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:35:29,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2022-02-21 03:35:29,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:35:29,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:35:29,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2022-02-21 03:35:29,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:29,630 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-02-21 03:35:29,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2022-02-21 03:35:29,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-02-21 03:35:29,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:29,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 35 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 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 03:35:29,632 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 35 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 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 03:35:29,632 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 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 03:35:29,632 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:29,633 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-02-21 03:35:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-02-21 03:35:29,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:29,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:29,633 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 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 27 states and 35 transitions. [2022-02-21 03:35:29,633 INFO L87 Difference]: Start difference. First operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 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 27 states and 35 transitions. [2022-02-21 03:35:29,633 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:29,634 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-02-21 03:35:29,634 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-02-21 03:35:29,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:29,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:29,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:29,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:29,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 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 03:35:29,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-02-21 03:35:29,635 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-21 03:35:29,635 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-21 03:35:29,635 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:35:29,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2022-02-21 03:35:29,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:29,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:29,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:29,636 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:29,636 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:29,636 INFO L791 eck$LassoCheckResult]: Stem: 691#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 692#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, 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~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 701#L382 assume !(main_~length1~0#1 < 1); 710#L382-2 assume !(main_~length2~0#1 < 1); 693#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(49, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(49, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#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 cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 694#L369-4 call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 702#L369-1 assume !!(49 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; 715#L372-5 call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 49 != cstrpbrk_#t~mem208#1; 714#L372-1 assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 712#L372-3 assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; 695#L372-6 call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 696#L374 assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; 706#L369-3 cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; 703#L369-4 call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 705#L369-1 assume !!(49 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; 697#L372-5 [2022-02-21 03:35:29,636 INFO L793 eck$LassoCheckResult]: Loop: 697#L372-5 call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 49 != cstrpbrk_#t~mem208#1; 698#L372-1 assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 707#L372-3 assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, 1 + cstrpbrk_#t~post211#1.offset;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset; 697#L372-5 [2022-02-21 03:35:29,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:29,637 INFO L85 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2022-02-21 03:35:29,637 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:29,637 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808400769] [2022-02-21 03:35:29,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:29,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:29,659 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:29,681 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:29,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:29,682 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2022-02-21 03:35:29,682 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:29,682 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665953236] [2022-02-21 03:35:29,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:29,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:29,688 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:29,692 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:29,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:29,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2022-02-21 03:35:29,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:29,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598310083] [2022-02-21 03:35:29,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:29,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:29,709 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 03:35:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:29,725 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:29,746 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:30,729 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:30,729 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:30,729 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:30,729 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:30,729 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:30,729 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:30,729 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:30,729 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:30,729 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_diffterm_alloca.i_Iteration5_Lasso [2022-02-21 03:35:30,729 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:30,729 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:30,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:31,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:31,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:31,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:31,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:31,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:31,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:31,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:31,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,781 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:32,781 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:32,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:32,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:32,795 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 03:35:32,796 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 03:35:32,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:32,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:32,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:32,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:32,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:32,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:32,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:32,821 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:32,849 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 03:35:32,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:32,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:32,851 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 03:35:32,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 03:35:32,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:32,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:32,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:32,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:32,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:32,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:32,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:32,879 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 03:35:32,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:32,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:32,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:32,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:32,916 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 03:35:32,917 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 03:35:32,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:32,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:32,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:32,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:32,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:32,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:32,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:32,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:32,927 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:32,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-02-21 03:35:32,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:32,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:32,953 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 03:35:32,954 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 03:35:32,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:32,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:32,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:32,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:32,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:32,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:32,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:32,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:32,973 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:32,999 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 03:35:32,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:32,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,000 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 03:35:33,002 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 03:35:33,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:33,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:33,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:33,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,040 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 03:35:33,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,042 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 03:35:33,044 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 03:35:33,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:33,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:33,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-02-21 03:35:33,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,085 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 03:35:33,086 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 03:35:33,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:33,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:33,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:33,097 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,119 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 03:35:33,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,120 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 03:35:33,126 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 03:35:33,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:33,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:33,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:33,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:33,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,161 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 03:35:33,161 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 03:35:33,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:33,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:33,186 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-02-21 03:35:33,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,207 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 03:35:33,208 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 03:35:33,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:33,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:33,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:33,218 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-02-21 03:35:33,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,238 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 03:35:33,239 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 03:35:33,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:33,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:33,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:33,259 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,276 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 03:35:33,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,277 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 03:35:33,278 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 03:35:33,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:33,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:33,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:33,297 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 03:35:33,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,314 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 03:35:33,315 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 03:35:33,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,325 INFO L203 nArgumentSynthesizer]: 6 stem disjuncts [2022-02-21 03:35:33,325 INFO L204 nArgumentSynthesizer]: 7 loop disjuncts [2022-02-21 03:35:33,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,442 INFO L401 nArgumentSynthesizer]: We have 196 Motzkin's Theorem applications. [2022-02-21 03:35:33,442 INFO L402 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2022-02-21 03:35:33,692 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:33,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,728 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 03:35:33,740 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 03:35:33,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:33,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:33,776 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,794 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 03:35:33,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,796 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 03:35:33,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:33,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:33,830 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 03:35:33,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,854 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 03:35:33,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,859 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 03:35:33,860 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 03:35:33,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:33,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:33,884 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,903 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 03:35:33,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,905 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:33,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 03:35:33,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:33,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:33,941 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-02-21 03:35:33,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,959 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:33,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 03:35:33,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:33,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:33,997 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:34,041 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-02-21 03:35:34,041 INFO L444 ModelExtractionUtils]: 10 out of 55 variables were initially zero. Simplification set additionally 42 variables to zero. [2022-02-21 03:35:34,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:34,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:34,044 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:34,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 03:35:34,047 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:34,076 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:34,076 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:34,076 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_1, ULTIMATE.start_cstrpbrk_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_1 - 1*ULTIMATE.start_cstrpbrk_~s~0#1.offset Supporting invariants [] [2022-02-21 03:35:34,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:34,240 INFO L297 tatePredicateManager]: 29 out of 30 supporting invariants were superfluous and have been removed [2022-02-21 03:35:34,245 INFO L390 LassoCheck]: Loop: "call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 49 != cstrpbrk_#t~mem208#1;" "assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256);" "assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, 1 + cstrpbrk_#t~post211#1.offset;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset;" [2022-02-21 03:35:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:34,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:34,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:34,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:34,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {839#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {839#unseeded} is VALID [2022-02-21 03:35:34,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {839#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, 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~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {839#unseeded} is VALID [2022-02-21 03:35:34,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {839#unseeded} assume !(main_~length1~0#1 < 1); {839#unseeded} is VALID [2022-02-21 03:35:34,404 INFO L290 TraceCheckUtils]: 3: Hoare triple {839#unseeded} assume !(main_~length2~0#1 < 1); {839#unseeded} is VALID [2022-02-21 03:35:34,405 INFO L290 TraceCheckUtils]: 4: Hoare triple {839#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(49, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(49, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#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 cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; {1024#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {1024#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {1024#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {1024#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !!(49 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {1024#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {1024#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 49 != cstrpbrk_#t~mem208#1; {1024#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {1024#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {1024#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {1024#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; {1024#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {1024#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); {1024#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {1024#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; {1024#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {1024#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; {1024#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {1024#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {1024#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {1024#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !!(49 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {1003#(and (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:34,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:34,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:34,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {1004#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 49 != cstrpbrk_#t~mem208#1; {1055#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} is VALID [2022-02-21 03:35:34,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {1055#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {1055#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} is VALID [2022-02-21 03:35:34,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {1055#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, 1 + cstrpbrk_#t~post211#1.offset;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset; {1006#(and (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)))) unseeded))} is VALID [2022-02-21 03:35:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:34,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:34,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,492 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:35:34,492 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,561 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 41 states and 51 transitions. Complement of second has 6 states. [2022-02-21 03:35:34,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:35:34,562 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:34,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:34,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:34,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:34,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:34,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:34,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:34,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2022-02-21 03:35:34,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:34,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:34,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:34,565 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:34,565 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:34,565 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:34,566 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:34,567 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 51 transitions. cyclomatic complexity: 13 [2022-02-21 03:35:34,567 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:34,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:34,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 2 letters. [2022-02-21 03:35:34,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:34,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:34,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 41 letters. Loop has 41 letters. [2022-02-21 03:35:34,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:34,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:34,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 25 letters. Loop has 25 letters. [2022-02-21 03:35:34,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:34,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:34,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:34,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:34,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:34,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:34,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:34,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:34,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 2 letters. [2022-02-21 03:35:34,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:34,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:34,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:34,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:34,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:34,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,580 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:34,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:35:34,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,585 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:35:34,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:34,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:34,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:34,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {839#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {839#unseeded} is VALID [2022-02-21 03:35:34,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {839#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, 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~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {839#unseeded} is VALID [2022-02-21 03:35:34,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {839#unseeded} assume !(main_~length1~0#1 < 1); {839#unseeded} is VALID [2022-02-21 03:35:34,698 INFO L290 TraceCheckUtils]: 3: Hoare triple {839#unseeded} assume !(main_~length2~0#1 < 1); {839#unseeded} is VALID [2022-02-21 03:35:34,699 INFO L290 TraceCheckUtils]: 4: Hoare triple {839#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(49, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(49, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#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 cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; {1130#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {1130#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {1130#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {1130#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !!(49 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {1130#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {1130#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 49 != cstrpbrk_#t~mem208#1; {1130#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {1130#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {1130#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {1130#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; {1130#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {1130#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); {1130#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {1130#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; {1130#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {1130#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; {1130#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {1130#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {1130#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {1130#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !!(49 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {1003#(and (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:34,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:34,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:34,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:34,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {1004#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 49 != cstrpbrk_#t~mem208#1; {1161#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} is VALID [2022-02-21 03:35:34,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {1161#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {1161#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} is VALID [2022-02-21 03:35:34,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {1161#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, 1 + cstrpbrk_#t~post211#1.offset;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset; {1006#(and (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)))) unseeded))} is VALID [2022-02-21 03:35:34,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:34,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:34,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,804 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:35:34,804 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,864 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 41 states and 51 transitions. Complement of second has 6 states. [2022-02-21 03:35:34,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:35:34,864 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:34,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:34,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:34,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:34,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:34,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:34,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:34,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2022-02-21 03:35:34,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:34,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:34,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:34,866 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:34,866 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:34,866 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:34,867 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:34,867 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 51 transitions. cyclomatic complexity: 13 [2022-02-21 03:35:34,867 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:34,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:34,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 2 letters. [2022-02-21 03:35:34,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:34,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:34,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 41 letters. Loop has 41 letters. [2022-02-21 03:35:34,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:34,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:34,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 25 letters. Loop has 25 letters. [2022-02-21 03:35:34,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:34,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:34,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:34,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:34,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:34,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:34,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:34,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:34,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 2 letters. [2022-02-21 03:35:34,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:34,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:34,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:34,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:34,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:34,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,879 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:34,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:34,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:35:34,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,880 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:35:34,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:34,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:34,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:34,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {839#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {839#unseeded} is VALID [2022-02-21 03:35:34,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {839#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, 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~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {839#unseeded} is VALID [2022-02-21 03:35:34,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {839#unseeded} assume !(main_~length1~0#1 < 1); {839#unseeded} is VALID [2022-02-21 03:35:34,988 INFO L290 TraceCheckUtils]: 3: Hoare triple {839#unseeded} assume !(main_~length2~0#1 < 1); {839#unseeded} is VALID [2022-02-21 03:35:34,990 INFO L290 TraceCheckUtils]: 4: Hoare triple {839#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(49, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(49, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#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 cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; {1236#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {1236#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {1236#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {1236#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !!(49 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {1236#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {1236#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 49 != cstrpbrk_#t~mem208#1; {1236#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {1236#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {1236#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {1236#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; {1236#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {1236#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); {1236#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {1236#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; {1236#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {1236#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; {1236#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {1236#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {1236#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:34,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {1236#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !!(49 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {1003#(and (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:35,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:35,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:35,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {1004#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 49 != cstrpbrk_#t~mem208#1; {1267#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} is VALID [2022-02-21 03:35:35,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {1267#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {1267#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} is VALID [2022-02-21 03:35:35,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {1267#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, 1 + cstrpbrk_#t~post211#1.offset;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset; {1006#(and (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)))) unseeded))} is VALID [2022-02-21 03:35:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:35,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:35,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:35,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:35,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,056 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:35:35,056 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:35,117 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 41 states and 53 transitions. Complement of second has 5 states. [2022-02-21 03:35:35,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:35:35,118 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:35,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:35,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:35,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:35,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:35,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:35,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:35,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:35,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. [2022-02-21 03:35:35,121 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:35,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:35,121 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:35,121 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:35,122 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:35,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:35,123 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:35,123 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2022-02-21 03:35:35,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2022-02-21 03:35:35,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:35,123 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:35:35,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:35,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:35,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 2 letters. [2022-02-21 03:35:35,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:35,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:35,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 41 letters. Loop has 41 letters. [2022-02-21 03:35:35,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:35,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:35,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 25 letters. Loop has 25 letters. [2022-02-21 03:35:35,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:35,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:35,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:35,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:35,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:35,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:35,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:35,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:35,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:35,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:35,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:35,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:35,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 2 letters. [2022-02-21 03:35:35,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:35,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,133 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 03:35:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-02-21 03:35:35,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:35:35,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:35:35,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2022-02-21 03:35:35,144 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:35,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2022-02-21 03:35:35,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:35:35,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:35:35,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:35:35,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:35,144 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:35,144 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:35,144 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:35,144 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:35:35,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:35:35,144 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:35,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:35,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:35:35 BoogieIcfgContainer [2022-02-21 03:35:35,151 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:35:35,152 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:35:35,152 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:35:35,152 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:35:35,152 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:22" (3/4) ... [2022-02-21 03:35:35,155 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:35:35,155 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:35:35,156 INFO L158 Benchmark]: Toolchain (without parser) took 13948.64ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 67.7MB in the beginning and 101.6MB in the end (delta: -33.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-02-21 03:35:35,157 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory was 54.3MB in the beginning and 54.3MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:35,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.07ms. Allocated memory is still 100.7MB. Free memory was 67.4MB in the beginning and 67.3MB in the end (delta: 81.1kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:35:35,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.38ms. Allocated memory is still 100.7MB. Free memory was 67.3MB in the beginning and 65.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:35,159 INFO L158 Benchmark]: Boogie Preprocessor took 36.13ms. Allocated memory is still 100.7MB. Free memory was 65.1MB in the beginning and 63.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:35,159 INFO L158 Benchmark]: RCFGBuilder took 389.08ms. Allocated memory is still 100.7MB. Free memory was 63.6MB in the beginning and 50.1MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:35:35,160 INFO L158 Benchmark]: BuchiAutomizer took 13030.28ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 50.1MB in the beginning and 101.6MB in the end (delta: -51.5MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2022-02-21 03:35:35,160 INFO L158 Benchmark]: Witness Printer took 3.62ms. Allocated memory is still 176.2MB. Free memory is still 101.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:35,161 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.16ms. Allocated memory is still 83.9MB. Free memory was 54.3MB in the beginning and 54.3MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.07ms. Allocated memory is still 100.7MB. Free memory was 67.4MB in the beginning and 67.3MB in the end (delta: 81.1kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.38ms. Allocated memory is still 100.7MB. Free memory was 67.3MB in the beginning and 65.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.13ms. Allocated memory is still 100.7MB. Free memory was 65.1MB in the beginning and 63.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 389.08ms. Allocated memory is still 100.7MB. Free memory was 63.6MB in the beginning and 50.1MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 13030.28ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 50.1MB in the beginning and 101.6MB in the end (delta: -51.5MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * Witness Printer took 3.62ms. Allocated memory is still 176.2MB. Free memory is still 101.6MB. 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, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[nondetString2] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 10.9s. Construction of modules took 0.1s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 185 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 114 IncrementalHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 105 mSDtfsCounter, 114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital266 mio100 ax100 hnf100 lsp103 ukn74 mio100 lsp32 div135 bol100 ite100 ukn100 eq162 hnf93 smp83 dnf582 smp37 tf100 neg94 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 378ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 6 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 196 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:35:35,184 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