./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/invert_string-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/invert_string-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3da85103e65fd13a584e838d8b961878044a0a70e09ad1788e3ca53a404f357 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:57:49,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:57:49,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:57:49,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:57:49,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:57:49,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:57:49,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:57:49,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:57:49,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:57:49,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:57:49,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:57:49,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:57:49,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:57:49,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:57:49,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:57:49,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:57:49,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:57:49,717 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:57:49,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:57:49,720 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:57:49,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:57:49,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:57:49,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:57:49,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:57:49,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:57:49,738 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:57:49,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:57:49,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:57:49,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:57:49,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:57:49,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:57:49,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:57:49,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:57:49,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:57:49,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:57:49,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:57:49,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:57:49,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:57:49,748 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:57:49,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:57:49,749 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:57:49,750 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 03:57:49,778 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:57:49,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:57:49,779 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:57:49,779 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:57:49,780 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:57:49,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:57:49,780 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:57:49,780 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:57:49,780 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:57:49,781 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:57:49,781 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:57:49,781 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:57:49,781 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:57:49,781 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:57:49,781 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:57:49,781 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:57:49,782 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:57:49,782 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:57:49,782 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:57:49,782 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:57:49,782 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:57:49,782 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:57:49,782 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:57:49,783 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:57:49,783 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:57:49,783 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:57:49,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:57:49,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:57:49,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:57:49,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:57:49,784 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:57:49,784 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:57:49,785 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3da85103e65fd13a584e838d8b961878044a0a70e09ad1788e3ca53a404f357 [2022-02-21 03:57:49,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:57:50,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:57:50,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:57:50,020 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:57:50,021 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:57:50,021 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/invert_string-1.c [2022-02-21 03:57:50,071 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6713af0b/0f1c9f0a2bf14e0894c7e2c143213de9/FLAG9bc876ae7 [2022-02-21 03:57:50,425 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:57:50,426 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/invert_string-1.c [2022-02-21 03:57:50,434 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6713af0b/0f1c9f0a2bf14e0894c7e2c143213de9/FLAG9bc876ae7 [2022-02-21 03:57:50,446 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6713af0b/0f1c9f0a2bf14e0894c7e2c143213de9 [2022-02-21 03:57:50,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:57:50,449 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:57:50,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:57:50,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:57:50,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:57:50,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:57:50" (1/1) ... [2022-02-21 03:57:50,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4933bf54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:50, skipping insertion in model container [2022-02-21 03:57:50,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:57:50" (1/1) ... [2022-02-21 03:57:50,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:57:50,474 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:57:50,604 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/invert_string-1.c[352,365] [2022-02-21 03:57:50,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:57:50,632 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:57:50,643 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/invert_string-1.c[352,365] [2022-02-21 03:57:50,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:57:50,663 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:57:50,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:50 WrapperNode [2022-02-21 03:57:50,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:57:50,665 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:57:50,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:57:50,665 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:57:50,670 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:57:50" (1/1) ... [2022-02-21 03:57:50,682 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:57:50" (1/1) ... [2022-02-21 03:57:50,700 INFO L137 Inliner]: procedures = 15, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2022-02-21 03:57:50,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:57:50,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:57:50,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:57:50,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:57:50,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:50" (1/1) ... [2022-02-21 03:57:50,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:50" (1/1) ... [2022-02-21 03:57:50,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:50" (1/1) ... [2022-02-21 03:57:50,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:50" (1/1) ... [2022-02-21 03:57:50,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:50" (1/1) ... [2022-02-21 03:57:50,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:50" (1/1) ... [2022-02-21 03:57:50,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:50" (1/1) ... [2022-02-21 03:57:50,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:57:50,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:57:50,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:57:50,740 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:57:50,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:50" (1/1) ... [2022-02-21 03:57:50,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:50,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:50,764 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:57:50,766 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:57:50,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:57:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:57:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:57:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:57:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:57:50,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:57:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:57:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:57:50,837 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:57:50,838 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:57:50,995 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:57:50,999 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:57:50,999 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-21 03:57:51,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:57:51 BoogieIcfgContainer [2022-02-21 03:57:51,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:57:51,001 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:57:51,001 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:57:51,003 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:57:51,004 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:57:51,004 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:57:50" (1/3) ... [2022-02-21 03:57:51,005 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25ce0322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:57:51, skipping insertion in model container [2022-02-21 03:57:51,005 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:57:51,005 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:50" (2/3) ... [2022-02-21 03:57:51,005 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25ce0322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:57:51, skipping insertion in model container [2022-02-21 03:57:51,005 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:57:51,005 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:57:51" (3/3) ... [2022-02-21 03:57:51,006 INFO L388 chiAutomizerObserver]: Analyzing ICFG invert_string-1.c [2022-02-21 03:57:51,057 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:57:51,057 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:57:51,058 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:57:51,058 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:57:51,058 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:57:51,058 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:57:51,058 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:57:51,058 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:57:51,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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:57:51,095 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:57:51,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:51,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:51,099 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:57:51,099 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:57:51,100 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:57:51,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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:57:51,103 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:57:51,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:51,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:51,103 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:57:51,104 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:57:51,113 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post10#1, main_~MAX~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~cont~0#1, main_~i~0#1, main_~j~0#1;main_~MAX~0#1 := (if main_#t~nondet4#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 4294967296 % 4294967296 else main_#t~nondet4#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet4#1; 14#L17true assume !!(main_~MAX~0#1 > 0); 15#L17-2true call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);havoc main_~cont~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~cont~0#1 := 0;main_~i~0#1 := 0; 18#L22-3true [2022-02-21 03:57:51,113 INFO L793 eck$LassoCheckResult]: Loop: 18#L22-3true assume !!(main_~i~0#1 < main_~MAX~0#1);call write~int(main_#t~nondet6#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet6#1; 10#L22-2true main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 18#L22-3true [2022-02-21 03:57:51,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:51,123 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-02-21 03:57:51,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:51,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117732272] [2022-02-21 03:57:51,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:51,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:51,254 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:51,318 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:51,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:51,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2022-02-21 03:57:51,322 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:51,322 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528963155] [2022-02-21 03:57:51,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:51,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:51,347 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:51,360 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:51,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:51,363 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2022-02-21 03:57:51,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:51,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341400331] [2022-02-21 03:57:51,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:51,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:51,399 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:51,415 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:52,299 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:57:52,300 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:57:52,300 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:57:52,300 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:57:52,300 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:57:52,300 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:52,301 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:57:52,301 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:57:52,301 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-1.c_Iteration1_Lasso [2022-02-21 03:57:52,301 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:57:52,301 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:57:52,312 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:57:52,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:57:52,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:57:52,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:57:52,325 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:57:52,328 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:57:52,331 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:57:52,333 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:57:52,336 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:57:52,338 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:57:52,640 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:57:52,643 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:57:52,646 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:57:52,649 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:57:52,651 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:57:52,654 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:57:53,101 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:57:53,104 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:57:53,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,107 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:57:53,117 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:57:53,119 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:57:53,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:53,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:53,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:53,148 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:53,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,170 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:57:53,171 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:57:53,175 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:57:53,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:53,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:53,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:53,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,222 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:57:53,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,223 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:57:53,224 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:57:53,225 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:57:53,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:53,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:53,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:53,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,263 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:57:53,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,264 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:57:53,265 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:57:53,266 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:57:53,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,307 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:57:53,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,308 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:57:53,310 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:57:53,313 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:57:53,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:53,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:53,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:53,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,338 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:57:53,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,340 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:57:53,341 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:57:53,342 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:57:53,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:53,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:53,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:53,371 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,386 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:57:53,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,388 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:57:53,388 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:57:53,391 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:57:53,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:53,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:53,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:53,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:53,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,425 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:57:53,426 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:57:53,428 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:57:53,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,437 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,437 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,456 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 03:57:53,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,473 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:57:53,474 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:57:53,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:57:53,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:53,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:53,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:53,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,506 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:57:53,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,509 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:57:53,509 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:57:53,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:53,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,546 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:57:53,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,552 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:57:53,552 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:57:53,553 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:57:53,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,562 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,562 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,582 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,597 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:57:53,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,599 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:57:53,605 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:57:53,605 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:57:53,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,619 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,634 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:57:53,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,635 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:57:53,641 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:57:53,642 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:57:53,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,650 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,667 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:53,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,687 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:57:53,688 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:57:53,688 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:57:53,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:53,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:53,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:53,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,711 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:57:53,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,712 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:57:53,713 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:57:53,714 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:57:53,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:53,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:53,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:53,721 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,736 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:57:53,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,737 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:57:53,738 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:57:53,740 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:57:53,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,780 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:57:53,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,781 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:57:53,782 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:57:53,783 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:57:53,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,790 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,790 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,798 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-02-21 03:57:53,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,817 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:57:53,817 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:57:53,820 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:57:53,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,827 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,827 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-02-21 03:57:53,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,847 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:57:53,851 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:57:53,851 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:57:53,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,859 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,859 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,890 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:57:53,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,892 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:57:53,893 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:57:53,894 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:57:53,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,923 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,939 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:57:53,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,940 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:57:53,941 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:57:53,942 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:57:53,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:53,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,981 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:57:53,982 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:57:53,983 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:57:53,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:54,015 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:57:54,059 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-02-21 03:57:54,059 INFO L444 ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-02-21 03:57:54,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:54,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:54,062 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:57:54,062 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:57:54,063 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:57:54,084 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:57:54,084 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:57:54,085 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#str1~0#1.offset, v_rep(select #length ULTIMATE.start_main_~#str1~0#1.base)_1) = -1*ULTIMATE.start_main_~i~0#1 - 1*ULTIMATE.start_main_~#str1~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~#str1~0#1.base)_1 Supporting invariants [] [2022-02-21 03:57:54,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:54,138 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2022-02-21 03:57:54,142 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~MAX~0#1);call write~int(main_#t~nondet6#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet6#1;" "main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2022-02-21 03:57:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:54,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:54,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:57:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:54,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:54,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {29#unseeded} is VALID [2022-02-21 03:57:54,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post10#1, main_~MAX~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~cont~0#1, main_~i~0#1, main_~j~0#1;main_~MAX~0#1 := (if main_#t~nondet4#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 4294967296 % 4294967296 else main_#t~nondet4#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet4#1; {29#unseeded} is VALID [2022-02-21 03:57:54,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#unseeded} assume !!(main_~MAX~0#1 > 0); {29#unseeded} is VALID [2022-02-21 03:57:54,216 INFO L290 TraceCheckUtils]: 3: Hoare triple {29#unseeded} call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);havoc main_~cont~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~cont~0#1 := 0;main_~i~0#1 := 0; {29#unseeded} is VALID [2022-02-21 03:57:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:54,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:57:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:54,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:54,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~#str1~0#1.offset|) (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))} assume !!(main_~i~0#1 < main_~MAX~0#1);call write~int(main_#t~nondet6#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet6#1; {106#(and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~#str1~0#1.offset|) (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))))} is VALID [2022-02-21 03:57:54,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {106#(and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~#str1~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~#str1~0#1.offset|) (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {92#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~#str1~0#1.offset|) (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))) unseeded)} is VALID [2022-02-21 03:57:54,258 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:57:54,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:57:54,292 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:57:54,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:57:54,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,298 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:57:54,300 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:57:54,361 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Result 38 states and 55 transitions. Complement of second has 8 states. [2022-02-21 03:57:54,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:57:54,361 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:57:54,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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:57:54,368 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:57:54,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:54,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:54,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:57:54,372 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:57:54,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:54,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:54,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 55 transitions. [2022-02-21 03:57:54,374 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:57:54,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:54,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:54,378 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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:57:54,381 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:57:54,384 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:57:54,384 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:57:54,387 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:57:54,387 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:57:54,387 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 55 transitions. cyclomatic complexity: 23 [2022-02-21 03:57:54,389 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:57:54,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 2 letters. [2022-02-21 03:57:54,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:57:54,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:57:54,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 1 letters. [2022-02-21 03:57:54,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:57:54,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:57:54,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:54,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:54,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:54,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 38 letters. Loop has 38 letters. [2022-02-21 03:57:54,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 38 letters. Loop has 38 letters. [2022-02-21 03:57:54,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 38 letters. Loop has 38 letters. [2022-02-21 03:57:54,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:57:54,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:57:54,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:57:54,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:57:54,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:57:54,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:57:54,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:57:54,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:54,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:54,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:57:54,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:57:54,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:57:54,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 5 letters. [2022-02-21 03:57:54,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:57:54,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:57:54,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:57:54,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:57:54,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:57:54,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:57:54,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:57:54,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:57:54,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:57:54,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:57:54,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:57:54,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:54,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:54,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:54,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 2 letters. [2022-02-21 03:57:54,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:57:54,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:57:54,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:57:54,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:57:54,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:57:54,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 1 letters. [2022-02-21 03:57:54,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:57:54,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:57:54,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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:57:54,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:57:54,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:57:54,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:57:54,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:57:54,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:57:54,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 5 letters. [2022-02-21 03:57:54,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:57:54,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:57:54,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:57:54,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:54,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:54,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:57:54,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:57:54,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:57:54,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:57:54,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:57:54,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:57:54,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:54,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:54,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:54,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:57:54,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:57:54,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:57:54,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,429 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:57:54,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:57:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-02-21 03:57:54,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:57:54,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:54,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:57:54,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 55 transitions. cyclomatic complexity: 23 [2022-02-21 03:57:54,437 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:57:54,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 16 states and 21 transitions. [2022-02-21 03:57:54,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 03:57:54,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 03:57:54,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2022-02-21 03:57:54,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:54,440 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-02-21 03:57:54,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2022-02-21 03:57:54,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-21 03:57:54,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:54,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 21 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:54,456 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 21 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:54,457 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:54,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:54,460 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2022-02-21 03:57:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2022-02-21 03:57:54,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:54,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:54,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 21 transitions. [2022-02-21 03:57:54,461 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 21 transitions. [2022-02-21 03:57:54,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:54,461 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2022-02-21 03:57:54,461 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2022-02-21 03:57:54,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:54,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:54,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:54,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:54,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:54,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2022-02-21 03:57:54,463 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-02-21 03:57:54,463 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-02-21 03:57:54,463 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:57:54,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2022-02-21 03:57:54,463 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:57:54,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:54,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:54,463 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:57:54,463 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:57:54,464 INFO L791 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 160#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post10#1, main_~MAX~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~cont~0#1, main_~i~0#1, main_~j~0#1;main_~MAX~0#1 := (if main_#t~nondet4#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 4294967296 % 4294967296 else main_#t~nondet4#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet4#1; 165#L17 assume !!(main_~MAX~0#1 > 0); 171#L17-2 call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);havoc main_~cont~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~cont~0#1 := 0;main_~i~0#1 := 0; 172#L22-3 assume !(main_~i~0#1 < main_~MAX~0#1); 163#L22-4 call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (main_~MAX~0#1 - 1), 1);main_~j~0#1 := 0;main_~i~0#1 := main_~MAX~0#1 - 1; 164#L29-3 [2022-02-21 03:57:54,464 INFO L793 eck$LassoCheckResult]: Loop: 164#L29-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem8#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset, 1);call write~int(main_#t~mem8#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 173#L29-2 main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 164#L29-3 [2022-02-21 03:57:54,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:54,464 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2022-02-21 03:57:54,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:54,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049766679] [2022-02-21 03:57:54,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:54,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:54,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:54,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {210#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {210#true} is VALID [2022-02-21 03:57:54,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post10#1, main_~MAX~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~cont~0#1, main_~i~0#1, main_~j~0#1;main_~MAX~0#1 := (if main_#t~nondet4#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 4294967296 % 4294967296 else main_#t~nondet4#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet4#1; {210#true} is VALID [2022-02-21 03:57:54,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {210#true} assume !!(main_~MAX~0#1 > 0); {212#(<= 1 |ULTIMATE.start_main_~MAX~0#1|)} is VALID [2022-02-21 03:57:54,554 INFO L290 TraceCheckUtils]: 3: Hoare triple {212#(<= 1 |ULTIMATE.start_main_~MAX~0#1|)} call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);havoc main_~cont~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~cont~0#1 := 0;main_~i~0#1 := 0; {213#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~MAX~0#1|))} is VALID [2022-02-21 03:57:54,554 INFO L290 TraceCheckUtils]: 4: Hoare triple {213#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~MAX~0#1|))} assume !(main_~i~0#1 < main_~MAX~0#1); {211#false} is VALID [2022-02-21 03:57:54,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {211#false} call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (main_~MAX~0#1 - 1), 1);main_~j~0#1 := 0;main_~i~0#1 := main_~MAX~0#1 - 1; {211#false} is VALID [2022-02-21 03:57:54,555 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:57:54,555 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:54,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049766679] [2022-02-21 03:57:54,556 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049766679] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:57:54,556 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:57:54,556 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:57:54,556 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294426497] [2022-02-21 03:57:54,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:57:54,558 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:57:54,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:54,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2022-02-21 03:57:54,559 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:54,559 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881274328] [2022-02-21 03:57:54,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:54,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:54,567 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:54,572 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:54,627 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:54,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:57:54,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:57:54,630 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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:57:54,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:54,678 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-21 03:57:54,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:57:54,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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:57:54,685 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:57:54,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2022-02-21 03:57:54,690 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:57:54,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 22 transitions. [2022-02-21 03:57:54,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-02-21 03:57:54,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-02-21 03:57:54,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2022-02-21 03:57:54,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:54,691 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-02-21 03:57:54,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2022-02-21 03:57:54,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2022-02-21 03:57:54,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:54,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 22 transitions. Second operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 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:57:54,694 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 22 transitions. Second operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 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:57:54,694 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 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:57:54,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:54,695 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-21 03:57:54,695 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-02-21 03:57:54,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:54,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:54,696 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 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 20 states and 22 transitions. [2022-02-21 03:57:54,696 INFO L87 Difference]: Start difference. First operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 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 20 states and 22 transitions. [2022-02-21 03:57:54,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:54,697 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-21 03:57:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-02-21 03:57:54,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:54,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:54,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:54,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:54,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 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:57:54,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-02-21 03:57:54,698 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-21 03:57:54,699 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-21 03:57:54,699 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:57:54,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2022-02-21 03:57:54,699 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:57:54,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:54,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:54,700 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:54,700 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:57:54,700 INFO L791 eck$LassoCheckResult]: Stem: 238#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 239#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post10#1, main_~MAX~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~cont~0#1, main_~i~0#1, main_~j~0#1;main_~MAX~0#1 := (if main_#t~nondet4#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 4294967296 % 4294967296 else main_#t~nondet4#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet4#1; 244#L17 assume !!(main_~MAX~0#1 > 0); 249#L17-2 call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);havoc main_~cont~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~cont~0#1 := 0;main_~i~0#1 := 0; 250#L22-3 assume !!(main_~i~0#1 < main_~MAX~0#1);call write~int(main_#t~nondet6#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet6#1; 245#L22-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 246#L22-3 assume !(main_~i~0#1 < main_~MAX~0#1); 242#L22-4 call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (main_~MAX~0#1 - 1), 1);main_~j~0#1 := 0;main_~i~0#1 := main_~MAX~0#1 - 1; 243#L29-3 [2022-02-21 03:57:54,700 INFO L793 eck$LassoCheckResult]: Loop: 243#L29-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem8#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset, 1);call write~int(main_#t~mem8#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 251#L29-2 main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 243#L29-3 [2022-02-21 03:57:54,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:54,701 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2022-02-21 03:57:54,701 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:54,701 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698160006] [2022-02-21 03:57:54,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:54,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:54,730 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:54,742 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:54,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:54,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2022-02-21 03:57:54,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:54,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018857380] [2022-02-21 03:57:54,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:54,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:54,751 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:54,755 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:54,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:54,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2022-02-21 03:57:54,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:54,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419898720] [2022-02-21 03:57:54,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:54,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:54,778 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:54,794 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:55,460 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:57:55,460 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:57:55,460 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:57:55,460 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:57:55,460 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:57:55,460 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:55,460 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:57:55,460 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:57:55,460 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-1.c_Iteration3_Lasso [2022-02-21 03:57:55,460 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:57:55,460 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:57:55,462 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:57:55,828 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:57:55,832 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:57:55,834 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:57:55,835 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:57:55,837 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:57:55,839 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:57:55,841 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:57:55,843 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:57:55,844 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:57:55,846 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:57:55,848 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:57:55,849 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:57:55,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:55,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:55,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,250 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:57:56,250 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:57:56,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,252 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:57:56,252 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:57:56,254 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:57:56,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:56,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:56,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:56,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:56,261 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:56,261 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:56,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:56,280 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:57:56,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,281 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:57:56,282 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:57:56,283 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:57:56,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:56,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:56,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:56,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:56,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:56,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:56,309 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:57:56,324 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-02-21 03:57:56,324 INFO L444 ModelExtractionUtils]: 2 out of 25 variables were initially zero. Simplification set additionally 20 variables to zero. [2022-02-21 03:57:56,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,325 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:57:56,326 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:57:56,327 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:57:56,336 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:57:56,336 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:57:56,336 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2022-02-21 03:57:56,352 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:57:56,412 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2022-02-21 03:57:56,422 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 >= 0);call main_#t~mem8#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset, 1);call write~int(main_#t~mem8#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" [2022-02-21 03:57:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:56,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:56,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:57:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:56,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:56,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {302#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {302#unseeded} is VALID [2022-02-21 03:57:56,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post10#1, main_~MAX~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~cont~0#1, main_~i~0#1, main_~j~0#1;main_~MAX~0#1 := (if main_#t~nondet4#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 4294967296 % 4294967296 else main_#t~nondet4#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet4#1; {302#unseeded} is VALID [2022-02-21 03:57:56,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {302#unseeded} assume !!(main_~MAX~0#1 > 0); {302#unseeded} is VALID [2022-02-21 03:57:56,475 INFO L290 TraceCheckUtils]: 3: Hoare triple {302#unseeded} call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);havoc main_~cont~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~cont~0#1 := 0;main_~i~0#1 := 0; {302#unseeded} is VALID [2022-02-21 03:57:56,476 INFO L290 TraceCheckUtils]: 4: Hoare triple {302#unseeded} assume !!(main_~i~0#1 < main_~MAX~0#1);call write~int(main_#t~nondet6#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet6#1; {302#unseeded} is VALID [2022-02-21 03:57:56,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {302#unseeded} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {302#unseeded} is VALID [2022-02-21 03:57:56,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {302#unseeded} assume !(main_~i~0#1 < main_~MAX~0#1); {302#unseeded} is VALID [2022-02-21 03:57:56,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {302#unseeded} call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (main_~MAX~0#1 - 1), 1);main_~j~0#1 := 0;main_~i~0#1 := main_~MAX~0#1 - 1; {302#unseeded} is VALID [2022-02-21 03:57:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:56,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:57:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:56,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:56,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {305#(>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~i~0#1|) 1))} assume !!(main_~i~0#1 >= 0);call main_#t~mem8#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset, 1);call write~int(main_#t~mem8#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {416#(and (>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~i~0#1|) 1)) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:57:56,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {416#(and (>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~i~0#1|) 1)) (<= 0 |ULTIMATE.start_main_~i~0#1|))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; {390#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_main_~i~0#1|) 1))) unseeded)} is VALID [2022-02-21 03:57:56,502 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:57:56,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:57:56,507 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:57:56,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 2 letters. [2022-02-21 03:57:56,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,508 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:57:56,508 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:57:56,531 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 18 states and 23 transitions. Complement of second has 7 states. [2022-02-21 03:57:56,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:57:56,532 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:57:56,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:57:56,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:56,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:56,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:57:56,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:57:56,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:56,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:56,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2022-02-21 03:57:56,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:57:56,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:56,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:56,533 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:57:56,537 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:57:56,538 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:57:56,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:57:56,540 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:57:56,540 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 23 transitions. cyclomatic complexity: 8 [2022-02-21 03:57:56,542 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:57:56,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:57:56,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 2 letters. [2022-02-21 03:57:56,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:57:56,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:57:56,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 1 letters. Loop has 2 letters. [2022-02-21 03:57:56,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:57:56,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:56,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 10 letters. Loop has 4 letters. [2022-02-21 03:57:56,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:56,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:57:56,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:57:56,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:57:56,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:57:56,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 15 letters. [2022-02-21 03:57:56,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:57:56,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:57:56,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:57:56,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:57:56,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:56,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 10 letters. Loop has 4 letters. [2022-02-21 03:57:56,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:56,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:57:56,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 11 letters. Loop has 4 letters. [2022-02-21 03:57:56,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:57:56,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:56,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 12 letters. Loop has 4 letters. [2022-02-21 03:57:56,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:56,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:57:56,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 13 letters. Loop has 4 letters. [2022-02-21 03:57:56,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:57:56,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:57:56,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 2 letters. [2022-02-21 03:57:56,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:57:56,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:57:56,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 2 letters. [2022-02-21 03:57:56,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:57:56,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:57:56,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 1 letters. Loop has 2 letters. [2022-02-21 03:57:56,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:57:56,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:56,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 10 letters. Loop has 4 letters. [2022-02-21 03:57:56,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:56,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:57:56,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 11 letters. Loop has 4 letters. [2022-02-21 03:57:56,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:57:56,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:56,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 12 letters. Loop has 4 letters. [2022-02-21 03:57:56,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:56,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:57:56,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 13 letters. Loop has 4 letters. [2022-02-21 03:57:56,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:57:56,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,558 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:57:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:57:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2022-02-21 03:57:56,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:57:56,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:57:56,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:57:56,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. cyclomatic complexity: 8 [2022-02-21 03:57:56,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:57:56,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 19 transitions. [2022-02-21 03:57:56,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:57:56,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:57:56,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2022-02-21 03:57:56,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:56,567 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 03:57:56,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2022-02-21 03:57:56,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-21 03:57:56,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:56,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 19 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 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:57:56,569 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 19 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 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:57:56,569 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 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:57:56,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:56,569 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-21 03:57:56,569 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-21 03:57:56,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:56,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:56,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 19 transitions. [2022-02-21 03:57:56,570 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 19 transitions. [2022-02-21 03:57:56,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:56,572 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-21 03:57:56,572 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-21 03:57:56,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:56,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:56,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:56,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:56,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 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:57:56,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-02-21 03:57:56,573 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 03:57:56,573 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 03:57:56,573 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:57:56,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2022-02-21 03:57:56,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:57:56,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:56,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:56,575 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:56,575 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:57:56,575 INFO L791 eck$LassoCheckResult]: Stem: 448#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 449#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post10#1, main_~MAX~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~cont~0#1, main_~i~0#1, main_~j~0#1;main_~MAX~0#1 := (if main_#t~nondet4#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 4294967296 % 4294967296 else main_#t~nondet4#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet4#1; 454#L17 assume !!(main_~MAX~0#1 > 0); 459#L17-2 call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);havoc main_~cont~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~cont~0#1 := 0;main_~i~0#1 := 0; 460#L22-3 assume !!(main_~i~0#1 < main_~MAX~0#1);call write~int(main_#t~nondet6#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet6#1; 455#L22-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 456#L22-3 assume !(main_~i~0#1 < main_~MAX~0#1); 452#L22-4 call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (main_~MAX~0#1 - 1), 1);main_~j~0#1 := 0;main_~i~0#1 := main_~MAX~0#1 - 1; 453#L29-3 assume !(main_~i~0#1 >= 0); 450#L29-4 main_~j~0#1 := main_~MAX~0#1 - 1;main_~i~0#1 := 0; 451#L35-3 [2022-02-21 03:57:56,576 INFO L793 eck$LassoCheckResult]: Loop: 451#L35-3 assume !!(main_~i~0#1 < main_~MAX~0#1);call main_#t~mem11#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 457#L7 assume !(0 == __VERIFIER_assert_~cond#1); 458#L7-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~j~0#1;main_~j~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; 463#L35-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 451#L35-3 [2022-02-21 03:57:56,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:56,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2022-02-21 03:57:56,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:56,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770297529] [2022-02-21 03:57:56,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:56,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:56,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {499#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {499#true} is VALID [2022-02-21 03:57:56,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {499#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post10#1, main_~MAX~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~cont~0#1, main_~i~0#1, main_~j~0#1;main_~MAX~0#1 := (if main_#t~nondet4#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 4294967296 % 4294967296 else main_#t~nondet4#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet4#1; {499#true} is VALID [2022-02-21 03:57:56,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {499#true} assume !!(main_~MAX~0#1 > 0); {501#(<= 1 |ULTIMATE.start_main_~MAX~0#1|)} is VALID [2022-02-21 03:57:56,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {501#(<= 1 |ULTIMATE.start_main_~MAX~0#1|)} call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);havoc main_~cont~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~cont~0#1 := 0;main_~i~0#1 := 0; {501#(<= 1 |ULTIMATE.start_main_~MAX~0#1|)} is VALID [2022-02-21 03:57:56,642 INFO L290 TraceCheckUtils]: 4: Hoare triple {501#(<= 1 |ULTIMATE.start_main_~MAX~0#1|)} assume !!(main_~i~0#1 < main_~MAX~0#1);call write~int(main_#t~nondet6#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet6#1; {501#(<= 1 |ULTIMATE.start_main_~MAX~0#1|)} is VALID [2022-02-21 03:57:56,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {501#(<= 1 |ULTIMATE.start_main_~MAX~0#1|)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {501#(<= 1 |ULTIMATE.start_main_~MAX~0#1|)} is VALID [2022-02-21 03:57:56,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {501#(<= 1 |ULTIMATE.start_main_~MAX~0#1|)} assume !(main_~i~0#1 < main_~MAX~0#1); {501#(<= 1 |ULTIMATE.start_main_~MAX~0#1|)} is VALID [2022-02-21 03:57:56,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {501#(<= 1 |ULTIMATE.start_main_~MAX~0#1|)} call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (main_~MAX~0#1 - 1), 1);main_~j~0#1 := 0;main_~i~0#1 := main_~MAX~0#1 - 1; {502#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:57:56,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {502#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 0); {500#false} is VALID [2022-02-21 03:57:56,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {500#false} main_~j~0#1 := main_~MAX~0#1 - 1;main_~i~0#1 := 0; {500#false} is VALID [2022-02-21 03:57:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:57:56,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:56,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770297529] [2022-02-21 03:57:56,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770297529] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:57:56,645 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:57:56,645 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:57:56,645 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070272372] [2022-02-21 03:57:56,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:57:56,646 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:57:56,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:56,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2315850, now seen corresponding path program 1 times [2022-02-21 03:57:56,646 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:56,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229780224] [2022-02-21 03:57:56,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:56,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:56,664 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:56,677 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:56,786 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:56,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:57:56,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:57:56,786 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 6 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:57:56,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:56,826 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-02-21 03:57:56,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:57:56,826 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:57:56,837 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:57:56,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2022-02-21 03:57:56,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:57:56,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 18 transitions. [2022-02-21 03:57:56,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:57:56,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:57:56,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2022-02-21 03:57:56,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:56,838 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-02-21 03:57:56,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2022-02-21 03:57:56,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-21 03:57:56,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:56,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 18 transitions. Second operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 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:57:56,839 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 18 transitions. Second operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 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:57:56,839 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 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:57:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:56,840 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-02-21 03:57:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-02-21 03:57:56,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:56,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:56,840 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 18 transitions. [2022-02-21 03:57:56,840 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 18 transitions. [2022-02-21 03:57:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:56,840 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-02-21 03:57:56,843 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-02-21 03:57:56,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:56,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:56,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:56,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 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:57:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-02-21 03:57:56,844 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-02-21 03:57:56,844 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-02-21 03:57:56,844 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:57:56,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2022-02-21 03:57:56,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:57:56,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:56,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:56,844 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:56,844 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:57:56,844 INFO L791 eck$LassoCheckResult]: Stem: 523#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 524#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post10#1, main_~MAX~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~cont~0#1, main_~i~0#1, main_~j~0#1;main_~MAX~0#1 := (if main_#t~nondet4#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 4294967296 % 4294967296 else main_#t~nondet4#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet4#1; 531#L17 assume !!(main_~MAX~0#1 > 0); 534#L17-2 call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);havoc main_~cont~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~cont~0#1 := 0;main_~i~0#1 := 0; 535#L22-3 assume !!(main_~i~0#1 < main_~MAX~0#1);call write~int(main_#t~nondet6#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet6#1; 529#L22-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 530#L22-3 assume !(main_~i~0#1 < main_~MAX~0#1); 527#L22-4 call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (main_~MAX~0#1 - 1), 1);main_~j~0#1 := 0;main_~i~0#1 := main_~MAX~0#1 - 1; 528#L29-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem8#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset, 1);call write~int(main_#t~mem8#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 536#L29-2 main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 537#L29-3 assume !(main_~i~0#1 >= 0); 525#L29-4 main_~j~0#1 := main_~MAX~0#1 - 1;main_~i~0#1 := 0; 526#L35-3 [2022-02-21 03:57:56,844 INFO L793 eck$LassoCheckResult]: Loop: 526#L35-3 assume !!(main_~i~0#1 < main_~MAX~0#1);call main_#t~mem11#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 532#L7 assume !(0 == __VERIFIER_assert_~cond#1); 533#L7-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~j~0#1;main_~j~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; 538#L35-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 526#L35-3 [2022-02-21 03:57:56,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:56,845 INFO L85 PathProgramCache]: Analyzing trace with hash -357814151, now seen corresponding path program 1 times [2022-02-21 03:57:56,845 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:56,845 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348450701] [2022-02-21 03:57:56,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:56,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:56,859 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:56,871 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:56,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:56,871 INFO L85 PathProgramCache]: Analyzing trace with hash 2315850, now seen corresponding path program 2 times [2022-02-21 03:57:56,871 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:56,871 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197108078] [2022-02-21 03:57:56,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:56,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:56,876 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:56,880 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:56,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:56,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1607633602, now seen corresponding path program 1 times [2022-02-21 03:57:56,880 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:56,880 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125810627] [2022-02-21 03:57:56,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:56,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:56,897 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:56,909 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:56,957 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:57:57,626 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:57:57,626 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:57:57,627 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:57:57,627 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:57:57,627 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:57:57,627 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:57,627 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:57:57,627 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:57:57,627 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-1.c_Iteration5_Lasso [2022-02-21 03:57:57,627 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:57:57,627 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:57:57,628 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:57:57,633 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:57:58,126 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:57:58,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:58,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:58,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:58,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:58,142 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:57:58,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:58,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:58,150 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:57:58,152 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:57:58,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:58,157 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:57:58,160 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:57:58,161 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:57:58,163 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:57:58,597 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:57:58,597 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:57:58,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:58,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:58,598 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:57:58,600 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:57:58,600 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:57:58,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:58,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:58,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:58,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:58,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:58,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:58,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:58,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:58,630 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:57:58,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:58,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:58,632 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:57:58,635 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:57:58,635 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:57:58,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:58,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:58,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:58,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:58,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:58,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:58,645 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:58,660 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:57:58,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:58,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:58,662 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:57:58,662 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:57:58,664 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:57:58,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:58,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:58,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:58,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:58,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:58,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:58,678 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:58,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:58,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:58,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:58,696 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:57:58,697 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:57:58,698 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:57:58,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:58,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:58,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:58,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:58,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:58,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:58,707 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:58,722 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:57:58,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:58,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:58,723 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:57:58,724 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:57:58,726 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:57:58,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:58,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:58,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:58,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:58,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:58,732 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:58,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:58,759 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:57:58,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:58,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:58,760 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:57:58,761 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:57:58,764 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:57:58,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:58,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:58,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:58,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:58,771 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:58,771 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:58,773 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:58,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-02-21 03:57:58,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:58,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:58,790 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:57:58,796 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:57:58,802 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:57:58,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:58,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:58,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:58,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:58,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:58,809 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:58,834 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:57:58,858 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2022-02-21 03:57:58,858 INFO L444 ModelExtractionUtils]: 3 out of 25 variables were initially zero. Simplification set additionally 19 variables to zero. [2022-02-21 03:57:58,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:58,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:58,866 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:57:58,867 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:57:58,868 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:57:58,874 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:57:58,874 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:57:58,874 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#str2~0#1.base)_3, ULTIMATE.start_main_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~#str2~0#1.base)_3 - 2*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 03:57:58,890 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:57:58,960 INFO L297 tatePredicateManager]: 16 out of 19 supporting invariants were superfluous and have been removed [2022-02-21 03:57:58,968 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~MAX~0#1);call main_#t~mem11#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~j~0#1;main_~j~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1;" "main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2022-02-21 03:57:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:58,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:59,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:57:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:59,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:59,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {580#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {580#unseeded} is VALID [2022-02-21 03:57:59,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {580#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post10#1, main_~MAX~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~cont~0#1, main_~i~0#1, main_~j~0#1;main_~MAX~0#1 := (if main_#t~nondet4#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 4294967296 % 4294967296 else main_#t~nondet4#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet4#1; {580#unseeded} is VALID [2022-02-21 03:57:59,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {580#unseeded} assume !!(main_~MAX~0#1 > 0); {706#(and (< 0 |ULTIMATE.start_main_~MAX~0#1|) unseeded)} is VALID [2022-02-21 03:57:59,200 INFO L290 TraceCheckUtils]: 3: Hoare triple {706#(and (< 0 |ULTIMATE.start_main_~MAX~0#1|) unseeded)} call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);havoc main_~cont~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~cont~0#1 := 0;main_~i~0#1 := 0; {710#(and (< 0 |ULTIMATE.start_main_~MAX~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) unseeded (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} is VALID [2022-02-21 03:57:59,201 INFO L290 TraceCheckUtils]: 4: Hoare triple {710#(and (< 0 |ULTIMATE.start_main_~MAX~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) unseeded (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~MAX~0#1);call write~int(main_#t~nondet6#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet6#1; {710#(and (< 0 |ULTIMATE.start_main_~MAX~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) unseeded (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} is VALID [2022-02-21 03:57:59,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {710#(and (< 0 |ULTIMATE.start_main_~MAX~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) unseeded (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {717#(and (< 0 |ULTIMATE.start_main_~MAX~0#1|) unseeded (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} is VALID [2022-02-21 03:57:59,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {717#(and (< 0 |ULTIMATE.start_main_~MAX~0#1|) unseeded (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} assume !(main_~i~0#1 < main_~MAX~0#1); {691#(and unseeded (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~#str1~0#1.offset| |ULTIMATE.start_main_~MAX~0#1|) |ULTIMATE.start_main_~#str2~0#1.offset|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} is VALID [2022-02-21 03:57:59,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {691#(and unseeded (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~#str1~0#1.offset| |ULTIMATE.start_main_~MAX~0#1|) |ULTIMATE.start_main_~#str2~0#1.offset|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (main_~MAX~0#1 - 1), 1);main_~j~0#1 := 0;main_~i~0#1 := main_~MAX~0#1 - 1; {691#(and unseeded (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~#str1~0#1.offset| |ULTIMATE.start_main_~MAX~0#1|) |ULTIMATE.start_main_~#str2~0#1.offset|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} is VALID [2022-02-21 03:57:59,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {691#(and unseeded (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~#str1~0#1.offset| |ULTIMATE.start_main_~MAX~0#1|) |ULTIMATE.start_main_~#str2~0#1.offset|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} assume !!(main_~i~0#1 >= 0);call main_#t~mem8#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset, 1);call write~int(main_#t~mem8#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {691#(and unseeded (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~#str1~0#1.offset| |ULTIMATE.start_main_~MAX~0#1|) |ULTIMATE.start_main_~#str2~0#1.offset|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} is VALID [2022-02-21 03:57:59,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {691#(and unseeded (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~#str1~0#1.offset| |ULTIMATE.start_main_~MAX~0#1|) |ULTIMATE.start_main_~#str2~0#1.offset|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; {691#(and unseeded (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~#str1~0#1.offset| |ULTIMATE.start_main_~MAX~0#1|) |ULTIMATE.start_main_~#str2~0#1.offset|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} is VALID [2022-02-21 03:57:59,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {691#(and unseeded (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~#str1~0#1.offset| |ULTIMATE.start_main_~MAX~0#1|) |ULTIMATE.start_main_~#str2~0#1.offset|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} assume !(main_~i~0#1 >= 0); {691#(and unseeded (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~#str1~0#1.offset| |ULTIMATE.start_main_~MAX~0#1|) |ULTIMATE.start_main_~#str2~0#1.offset|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} is VALID [2022-02-21 03:57:59,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {691#(and unseeded (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~#str1~0#1.offset| |ULTIMATE.start_main_~MAX~0#1|) |ULTIMATE.start_main_~#str2~0#1.offset|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} main_~j~0#1 := main_~MAX~0#1 - 1;main_~i~0#1 := 0; {691#(and unseeded (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~#str1~0#1.offset| |ULTIMATE.start_main_~MAX~0#1|) |ULTIMATE.start_main_~#str2~0#1.offset|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} is VALID [2022-02-21 03:57:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:59,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:57:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:59,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:59,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {692#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~#str2~0#1.base|))) (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~#str1~0#1.offset| |ULTIMATE.start_main_~MAX~0#1|) |ULTIMATE.start_main_~#str2~0#1.offset|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~MAX~0#1);call main_#t~mem11#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {736#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~#str2~0#1.base|))) (= (+ (- 1) |ULTIMATE.start_main_~MAX~0#1| |ULTIMATE.start_main_~#str1~0#1.offset|) |ULTIMATE.start_main_~#str2~0#1.offset|) (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~MAX~0#1|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_main_~#str2~0#1.base|)))} is VALID [2022-02-21 03:57:59,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {736#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~#str2~0#1.base|))) (= (+ (- 1) |ULTIMATE.start_main_~MAX~0#1| |ULTIMATE.start_main_~#str1~0#1.offset|) |ULTIMATE.start_main_~#str2~0#1.offset|) (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~MAX~0#1|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_main_~#str2~0#1.base|)))} assume !(0 == __VERIFIER_assert_~cond#1); {736#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~#str2~0#1.base|))) (= (+ (- 1) |ULTIMATE.start_main_~MAX~0#1| |ULTIMATE.start_main_~#str1~0#1.offset|) |ULTIMATE.start_main_~#str2~0#1.offset|) (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~MAX~0#1|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_main_~#str2~0#1.base|)))} is VALID [2022-02-21 03:57:59,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {736#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~#str2~0#1.base|))) (= (+ (- 1) |ULTIMATE.start_main_~MAX~0#1| |ULTIMATE.start_main_~#str1~0#1.offset|) |ULTIMATE.start_main_~#str2~0#1.offset|) (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~MAX~0#1|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_main_~#str2~0#1.base|)))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~j~0#1;main_~j~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {736#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~#str2~0#1.base|))) (= (+ (- 1) |ULTIMATE.start_main_~MAX~0#1| |ULTIMATE.start_main_~#str1~0#1.offset|) |ULTIMATE.start_main_~#str2~0#1.offset|) (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~MAX~0#1|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_main_~#str2~0#1.base|)))} is VALID [2022-02-21 03:57:59,318 INFO L290 TraceCheckUtils]: 3: Hoare triple {736#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~#str2~0#1.base|))) (= (+ (- 1) |ULTIMATE.start_main_~MAX~0#1| |ULTIMATE.start_main_~#str1~0#1.offset|) |ULTIMATE.start_main_~#str2~0#1.offset|) (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~MAX~0#1|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0) (<= 1 (select |#length| |ULTIMATE.start_main_~#str2~0#1.base|)))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {694#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~#str2~0#1.base|)))) unseeded) (= |ULTIMATE.start_main_~#str2~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~#str1~0#1.offset| |ULTIMATE.start_main_~MAX~0#1|) |ULTIMATE.start_main_~#str2~0#1.offset|) (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))} is VALID [2022-02-21 03:57:59,318 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:57:59,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:59,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:59,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:59,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,330 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2022-02-21 03:57:59,330 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:59,484 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 5. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 39 transitions. Complement of second has 11 states. [2022-02-21 03:57:59,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2022-02-21 03:57:59,484 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:57:59,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. cyclomatic complexity: 5 [2022-02-21 03:57:59,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:59,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:59,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:59,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:57:59,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:59,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:59,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 39 transitions. [2022-02-21 03:57:59,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:57:59,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:59,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:59,485 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 18 transitions. cyclomatic complexity: 5 [2022-02-21 03:57:59,486 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:57:59,486 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:59,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:57:59,486 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:57:59,486 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 39 transitions. cyclomatic complexity: 10 [2022-02-21 03:57:59,487 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:57:59,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:59,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:59,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:59,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:59,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:59,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:59,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:57:59,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:57:59,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:57:59,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 5 Stem has 34 letters. Loop has 34 letters. [2022-02-21 03:57:59,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 34 letters. [2022-02-21 03:57:59,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 10 Stem has 34 letters. Loop has 34 letters. [2022-02-21 03:57:59,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:57:59,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:57:59,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:57:59,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:57:59,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:57:59,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:57:59,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:57:59,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:57:59,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:57:59,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:57:59,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:57:59,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:57:59,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:57:59,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:57:59,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:57:59,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:59,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:59,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:59,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:59,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:59,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:59,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:57:59,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:57:59,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:57:59,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:57:59,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:57:59,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:57:59,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 5 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:57:59,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:57:59,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:57:59,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:57:59,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:57:59,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 39 transitions. cyclomatic complexity: 10 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:57:59,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,517 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:57:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2022-02-21 03:57:59,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 26 transitions. Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:59,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 26 transitions. Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:57:59,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 26 transitions. Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:57:59,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:59,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 39 transitions. cyclomatic complexity: 10 [2022-02-21 03:57:59,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:57:59,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 21 states and 23 transitions. [2022-02-21 03:57:59,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 03:57:59,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 03:57:59,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2022-02-21 03:57:59,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:59,520 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-02-21 03:57:59,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2022-02-21 03:57:59,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2022-02-21 03:57:59,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:59,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 23 transitions. Second operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:59,522 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 23 transitions. Second operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:59,523 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:59,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:59,523 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-21 03:57:59,523 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-21 03:57:59,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:59,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:59,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states and 23 transitions. [2022-02-21 03:57:59,524 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states and 23 transitions. [2022-02-21 03:57:59,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:59,525 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-21 03:57:59,525 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-21 03:57:59,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:59,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:59,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:59,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:59,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-02-21 03:57:59,526 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-02-21 03:57:59,526 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-02-21 03:57:59,526 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:57:59,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2022-02-21 03:57:59,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:57:59,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:59,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:59,527 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:59,527 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:57:59,528 INFO L791 eck$LassoCheckResult]: Stem: 805#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 806#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post10#1, main_~MAX~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~cont~0#1, main_~i~0#1, main_~j~0#1;main_~MAX~0#1 := (if main_#t~nondet4#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 4294967296 % 4294967296 else main_#t~nondet4#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet4#1; 813#L17 assume !!(main_~MAX~0#1 > 0); 816#L17-2 call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);havoc main_~cont~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~cont~0#1 := 0;main_~i~0#1 := 0; 817#L22-3 assume !!(main_~i~0#1 < main_~MAX~0#1);call write~int(main_#t~nondet6#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet6#1; 811#L22-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 812#L22-3 assume !!(main_~i~0#1 < main_~MAX~0#1);call write~int(main_#t~nondet6#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet6#1; 821#L22-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 822#L22-3 assume !(main_~i~0#1 < main_~MAX~0#1); 809#L22-4 call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (main_~MAX~0#1 - 1), 1);main_~j~0#1 := 0;main_~i~0#1 := main_~MAX~0#1 - 1; 810#L29-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem8#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset, 1);call write~int(main_#t~mem8#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 818#L29-2 main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 819#L29-3 assume !(main_~i~0#1 >= 0); 807#L29-4 main_~j~0#1 := main_~MAX~0#1 - 1;main_~i~0#1 := 0; 808#L35-3 [2022-02-21 03:57:59,528 INFO L793 eck$LassoCheckResult]: Loop: 808#L35-3 assume !!(main_~i~0#1 < main_~MAX~0#1);call main_#t~mem11#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 814#L7 assume !(0 == __VERIFIER_assert_~cond#1); 815#L7-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~j~0#1;main_~j~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; 820#L35-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 808#L35-3 [2022-02-21 03:57:59,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:59,528 INFO L85 PathProgramCache]: Analyzing trace with hash -793654437, now seen corresponding path program 2 times [2022-02-21 03:57:59,528 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:59,529 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632442760] [2022-02-21 03:57:59,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:59,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:59,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {868#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {868#true} is VALID [2022-02-21 03:57:59,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {868#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post10#1, main_~MAX~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~cont~0#1, main_~i~0#1, main_~j~0#1;main_~MAX~0#1 := (if main_#t~nondet4#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 4294967296 % 4294967296 else main_#t~nondet4#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet4#1; {868#true} is VALID [2022-02-21 03:57:59,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {868#true} assume !!(main_~MAX~0#1 > 0); {868#true} is VALID [2022-02-21 03:57:59,583 INFO L290 TraceCheckUtils]: 3: Hoare triple {868#true} call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);havoc main_~cont~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~cont~0#1 := 0;main_~i~0#1 := 0; {870#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:57:59,584 INFO L290 TraceCheckUtils]: 4: Hoare triple {870#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~MAX~0#1);call write~int(main_#t~nondet6#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet6#1; {870#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:57:59,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {870#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {871#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:57:59,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {871#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~MAX~0#1);call write~int(main_#t~nondet6#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet6#1; {872#(<= 2 |ULTIMATE.start_main_~MAX~0#1|)} is VALID [2022-02-21 03:57:59,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {872#(<= 2 |ULTIMATE.start_main_~MAX~0#1|)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {872#(<= 2 |ULTIMATE.start_main_~MAX~0#1|)} is VALID [2022-02-21 03:57:59,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {872#(<= 2 |ULTIMATE.start_main_~MAX~0#1|)} assume !(main_~i~0#1 < main_~MAX~0#1); {872#(<= 2 |ULTIMATE.start_main_~MAX~0#1|)} is VALID [2022-02-21 03:57:59,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {872#(<= 2 |ULTIMATE.start_main_~MAX~0#1|)} call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (main_~MAX~0#1 - 1), 1);main_~j~0#1 := 0;main_~i~0#1 := main_~MAX~0#1 - 1; {871#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:57:59,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {871#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 >= 0);call main_#t~mem8#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset, 1);call write~int(main_#t~mem8#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {871#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:57:59,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {871#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; {873#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:57:59,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {873#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 0); {869#false} is VALID [2022-02-21 03:57:59,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {869#false} main_~j~0#1 := main_~MAX~0#1 - 1;main_~i~0#1 := 0; {869#false} is VALID [2022-02-21 03:57:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:59,589 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:59,589 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632442760] [2022-02-21 03:57:59,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632442760] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:57:59,589 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792216558] [2022-02-21 03:57:59,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:57:59,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:57:59,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:59,591 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:57:59,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-02-21 03:57:59,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:57:59,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:57:59,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:57:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:59,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:59,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:59,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {868#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {868#true} is VALID [2022-02-21 03:57:59,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {868#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post10#1, main_~MAX~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~cont~0#1, main_~i~0#1, main_~j~0#1;main_~MAX~0#1 := (if main_#t~nondet4#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 4294967296 % 4294967296 else main_#t~nondet4#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet4#1; {868#true} is VALID [2022-02-21 03:57:59,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {868#true} assume !!(main_~MAX~0#1 > 0); {868#true} is VALID [2022-02-21 03:57:59,756 INFO L290 TraceCheckUtils]: 3: Hoare triple {868#true} call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);havoc main_~cont~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~cont~0#1 := 0;main_~i~0#1 := 0; {873#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:57:59,756 INFO L290 TraceCheckUtils]: 4: Hoare triple {873#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~MAX~0#1);call write~int(main_#t~nondet6#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet6#1; {873#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:57:59,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {873#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {871#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:57:59,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {871#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~MAX~0#1);call write~int(main_#t~nondet6#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet6#1; {872#(<= 2 |ULTIMATE.start_main_~MAX~0#1|)} is VALID [2022-02-21 03:57:59,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {872#(<= 2 |ULTIMATE.start_main_~MAX~0#1|)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {872#(<= 2 |ULTIMATE.start_main_~MAX~0#1|)} is VALID [2022-02-21 03:57:59,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {872#(<= 2 |ULTIMATE.start_main_~MAX~0#1|)} assume !(main_~i~0#1 < main_~MAX~0#1); {872#(<= 2 |ULTIMATE.start_main_~MAX~0#1|)} is VALID [2022-02-21 03:57:59,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {872#(<= 2 |ULTIMATE.start_main_~MAX~0#1|)} call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (main_~MAX~0#1 - 1), 1);main_~j~0#1 := 0;main_~i~0#1 := main_~MAX~0#1 - 1; {871#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:57:59,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {871#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 >= 0);call main_#t~mem8#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset, 1);call write~int(main_#t~mem8#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {871#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:57:59,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {871#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; {873#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:57:59,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {873#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 0); {869#false} is VALID [2022-02-21 03:57:59,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {869#false} main_~j~0#1 := main_~MAX~0#1 - 1;main_~i~0#1 := 0; {869#false} is VALID [2022-02-21 03:57:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:59,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:57:59,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {869#false} main_~j~0#1 := main_~MAX~0#1 - 1;main_~i~0#1 := 0; {869#false} is VALID [2022-02-21 03:57:59,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {873#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 0); {869#false} is VALID [2022-02-21 03:57:59,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {871#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; {873#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:57:59,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {871#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 >= 0);call main_#t~mem8#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset, 1);call write~int(main_#t~mem8#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {871#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:57:59,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {872#(<= 2 |ULTIMATE.start_main_~MAX~0#1|)} call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (main_~MAX~0#1 - 1), 1);main_~j~0#1 := 0;main_~i~0#1 := main_~MAX~0#1 - 1; {871#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:57:59,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {872#(<= 2 |ULTIMATE.start_main_~MAX~0#1|)} assume !(main_~i~0#1 < main_~MAX~0#1); {872#(<= 2 |ULTIMATE.start_main_~MAX~0#1|)} is VALID [2022-02-21 03:57:59,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {872#(<= 2 |ULTIMATE.start_main_~MAX~0#1|)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {872#(<= 2 |ULTIMATE.start_main_~MAX~0#1|)} is VALID [2022-02-21 03:57:59,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {871#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~MAX~0#1);call write~int(main_#t~nondet6#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet6#1; {872#(<= 2 |ULTIMATE.start_main_~MAX~0#1|)} is VALID [2022-02-21 03:57:59,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {873#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {871#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:57:59,831 INFO L290 TraceCheckUtils]: 4: Hoare triple {873#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~MAX~0#1);call write~int(main_#t~nondet6#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet6#1; {873#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:57:59,832 INFO L290 TraceCheckUtils]: 3: Hoare triple {868#true} call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);havoc main_~cont~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~cont~0#1 := 0;main_~i~0#1 := 0; {873#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:57:59,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {868#true} assume !!(main_~MAX~0#1 > 0); {868#true} is VALID [2022-02-21 03:57:59,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {868#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post10#1, main_~MAX~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~cont~0#1, main_~i~0#1, main_~j~0#1;main_~MAX~0#1 := (if main_#t~nondet4#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 4294967296 % 4294967296 else main_#t~nondet4#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet4#1; {868#true} is VALID [2022-02-21 03:57:59,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {868#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {868#true} is VALID [2022-02-21 03:57:59,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:59,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792216558] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:57:59,833 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:57:59,833 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-02-21 03:57:59,833 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536447245] [2022-02-21 03:57:59,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:57:59,833 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:57:59,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:59,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2315850, now seen corresponding path program 3 times [2022-02-21 03:57:59,834 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:59,834 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019475236] [2022-02-21 03:57:59,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:59,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:59,843 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:59,854 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:59,965 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:59,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:57:59,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:57:59,966 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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:58:00,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:58:00,076 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-02-21 03:58:00,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:58:00,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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:58:00,089 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:58:00,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2022-02-21 03:58:00,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:58:00,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 26 transitions. [2022-02-21 03:58:00,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 03:58:00,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 03:58:00,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2022-02-21 03:58:00,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:58:00,091 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-02-21 03:58:00,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2022-02-21 03:58:00,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-02-21 03:58:00,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:58:00,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 26 transitions. Second operand has 20 states, 20 states have (on average 1.1) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:00,092 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 26 transitions. Second operand has 20 states, 20 states have (on average 1.1) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:00,092 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 20 states, 20 states have (on average 1.1) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:00,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:58:00,093 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-02-21 03:58:00,093 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-02-21 03:58:00,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:58:00,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:58:00,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 20 states have (on average 1.1) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states and 26 transitions. [2022-02-21 03:58:00,093 INFO L87 Difference]: Start difference. First operand has 20 states, 20 states have (on average 1.1) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states and 26 transitions. [2022-02-21 03:58:00,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:58:00,094 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-02-21 03:58:00,094 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-02-21 03:58:00,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:58:00,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:58:00,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:58:00,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:58:00,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.1) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:00,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-02-21 03:58:00,095 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-02-21 03:58:00,095 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-02-21 03:58:00,095 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:58:00,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2022-02-21 03:58:00,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:58:00,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:00,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:00,095 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:58:00,095 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:58:00,095 INFO L791 eck$LassoCheckResult]: Stem: 984#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 985#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post10#1, main_~MAX~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~cont~0#1, main_~i~0#1, main_~j~0#1;main_~MAX~0#1 := (if main_#t~nondet4#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 4294967296 % 4294967296 else main_#t~nondet4#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet4#1; 992#L17 assume !!(main_~MAX~0#1 > 0); 995#L17-2 call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);havoc main_~cont~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~cont~0#1 := 0;main_~i~0#1 := 0; 996#L22-3 assume !!(main_~i~0#1 < main_~MAX~0#1);call write~int(main_#t~nondet6#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet6#1; 990#L22-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 991#L22-3 assume !!(main_~i~0#1 < main_~MAX~0#1);call write~int(main_#t~nondet6#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet6#1; 1001#L22-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1003#L22-3 assume !(main_~i~0#1 < main_~MAX~0#1); 988#L22-4 call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (main_~MAX~0#1 - 1), 1);main_~j~0#1 := 0;main_~i~0#1 := main_~MAX~0#1 - 1; 989#L29-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem8#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset, 1);call write~int(main_#t~mem8#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 997#L29-2 main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 998#L29-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem8#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset, 1);call write~int(main_#t~mem8#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 999#L29-2 main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1002#L29-3 assume !(main_~i~0#1 >= 0); 986#L29-4 main_~j~0#1 := main_~MAX~0#1 - 1;main_~i~0#1 := 0; 987#L35-3 [2022-02-21 03:58:00,096 INFO L793 eck$LassoCheckResult]: Loop: 987#L35-3 assume !!(main_~i~0#1 < main_~MAX~0#1);call main_#t~mem11#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 993#L7 assume !(0 == __VERIFIER_assert_~cond#1); 994#L7-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~j~0#1;main_~j~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; 1000#L35-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 987#L35-3 [2022-02-21 03:58:00,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:00,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1802321405, now seen corresponding path program 3 times [2022-02-21 03:58:00,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:00,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550471087] [2022-02-21 03:58:00,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:00,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:00,130 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:00,154 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:00,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:00,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2315850, now seen corresponding path program 4 times [2022-02-21 03:58:00,154 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:00,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908614259] [2022-02-21 03:58:00,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:00,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:00,159 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:00,161 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:00,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:00,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1451832902, now seen corresponding path program 2 times [2022-02-21 03:58:00,162 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:00,162 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973631708] [2022-02-21 03:58:00,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:00,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:00,182 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:00,195 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:01,869 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:58:01,869 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:58:01,869 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:58:01,869 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:58:01,869 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:58:01,869 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:01,870 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:58:01,870 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:58:01,870 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-1.c_Iteration7_Lasso [2022-02-21 03:58:01,870 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:58:01,870 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:58:01,872 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:58:01,874 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:58:02,382 WARN L259 bleTransFormulaUtils]: 4 quantified variables [2022-02-21 03:58:02,384 WARN L259 bleTransFormulaUtils]: 3 quantified variables [2022-02-21 03:58:02,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:58:02,391 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:58:02,392 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:58:02,395 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:58:02,396 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:58:02,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:58:02,401 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:58:02,402 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:58:02,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:58:02,405 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:58:02,407 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:58:02,408 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:58:02,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:58:02,411 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:58:02,809 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:58:02,809 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:58:02,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:02,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:02,810 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:58:02,811 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:58:02,813 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:58:02,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:02,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:02,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:02,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:02,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:02,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:02,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:02,823 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:02,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:02,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:02,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:02,839 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:58:02,840 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:58:02,841 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:58:02,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:02,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:02,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:02,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:02,850 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:58:02,850 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:58:02,853 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:02,871 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:58:02,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:02,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:02,872 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:58:02,872 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:58:02,874 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:58:02,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:02,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:02,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:02,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:02,882 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:58:02,882 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:58:02,884 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:02,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-02-21 03:58:02,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:02,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:02,900 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:58:02,901 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:58:02,902 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:58:02,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:02,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:02,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:02,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:02,910 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:58:02,910 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:58:02,920 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:02,938 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:58:02,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:02,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:02,940 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:58:02,941 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:58:02,942 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:58:02,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:02,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:02,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:02,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:02,949 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:58:02,949 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:58:02,952 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:02,969 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:58:02,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:02,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:02,970 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:58:02,971 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:58:02,973 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:58:02,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:02,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:02,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:02,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:02,986 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:58:02,986 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:58:02,995 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:58:03,008 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-02-21 03:58:03,009 INFO L444 ModelExtractionUtils]: 7 out of 25 variables were initially zero. Simplification set additionally 14 variables to zero. [2022-02-21 03:58:03,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:03,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:03,010 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:58:03,010 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:58:03,047 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:58:03,054 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 03:58:03,054 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:58:03,054 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#str1~0#1.base)_4, ULTIMATE.start_main_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~#str1~0#1.base)_4 + 2*ULTIMATE.start_main_~j~0#1 Supporting invariants [-1*ULTIMATE.start_main_~#str2~0#1.offset >= 0] [2022-02-21 03:58:03,070 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:58:03,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-02-21 03:58:03,154 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2022-02-21 03:58:03,159 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~MAX~0#1);call main_#t~mem11#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~j~0#1;main_~j~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1;" "main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2022-02-21 03:58:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:03,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:03,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:58:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:03,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:03,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {1061#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1061#unseeded} is VALID [2022-02-21 03:58:03,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {1061#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post10#1, main_~MAX~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~cont~0#1, main_~i~0#1, main_~j~0#1;main_~MAX~0#1 := (if main_#t~nondet4#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet4#1 % 4294967296 % 4294967296 else main_#t~nondet4#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet4#1; {1061#unseeded} is VALID [2022-02-21 03:58:03,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#unseeded} assume !!(main_~MAX~0#1 > 0); {1061#unseeded} is VALID [2022-02-21 03:58:03,283 INFO L290 TraceCheckUtils]: 3: Hoare triple {1061#unseeded} call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~MAX~0#1);havoc main_~cont~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~cont~0#1 := 0;main_~i~0#1 := 0; {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} is VALID [2022-02-21 03:58:03,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} assume !!(main_~i~0#1 < main_~MAX~0#1);call write~int(main_#t~nondet6#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet6#1; {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} is VALID [2022-02-21 03:58:03,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} is VALID [2022-02-21 03:58:03,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} assume !!(main_~i~0#1 < main_~MAX~0#1);call write~int(main_#t~nondet6#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet6#1; {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} is VALID [2022-02-21 03:58:03,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} is VALID [2022-02-21 03:58:03,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} assume !(main_~i~0#1 < main_~MAX~0#1); {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} is VALID [2022-02-21 03:58:03,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (main_~MAX~0#1 - 1), 1);main_~j~0#1 := 0;main_~i~0#1 := main_~MAX~0#1 - 1; {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} is VALID [2022-02-21 03:58:03,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} assume !!(main_~i~0#1 >= 0);call main_#t~mem8#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset, 1);call write~int(main_#t~mem8#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} is VALID [2022-02-21 03:58:03,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} is VALID [2022-02-21 03:58:03,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} assume !!(main_~i~0#1 >= 0);call main_#t~mem8#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset, 1);call write~int(main_#t~mem8#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} is VALID [2022-02-21 03:58:03,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} is VALID [2022-02-21 03:58:03,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} assume !(main_~i~0#1 >= 0); {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} is VALID [2022-02-21 03:58:03,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} main_~j~0#1 := main_~MAX~0#1 - 1;main_~i~0#1 := 0; {1155#(and unseeded (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} is VALID [2022-02-21 03:58:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:03,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:58:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:03,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:03,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {1156#(and (>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~j~0#1|) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} assume !!(main_~i~0#1 < main_~MAX~0#1);call main_#t~mem11#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int(main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem11#1 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1209#(and (>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~j~0#1|) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (<= 1 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~#str2~0#1.offset|)) (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} is VALID [2022-02-21 03:58:03,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {1209#(and (>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~j~0#1|) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (<= 1 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~#str2~0#1.offset|)) (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} assume !(0 == __VERIFIER_assert_~cond#1); {1209#(and (>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~j~0#1|) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (<= 1 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~#str2~0#1.offset|)) (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} is VALID [2022-02-21 03:58:03,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {1209#(and (>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~j~0#1|) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) (<= 1 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~#str2~0#1.offset|)) (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~j~0#1;main_~j~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {1216#(and (<= 0 (+ (div (+ oldRank0 (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 2) |ULTIMATE.start_main_~#str2~0#1.offset|)) (<= (+ |ULTIMATE.start_main_~j~0#1| 1) (div (+ oldRank0 (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 2)) (<= 1 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)) (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} is VALID [2022-02-21 03:58:03,411 INFO L290 TraceCheckUtils]: 3: Hoare triple {1216#(and (<= 0 (+ (div (+ oldRank0 (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 2) |ULTIMATE.start_main_~#str2~0#1.offset|)) (<= (+ |ULTIMATE.start_main_~j~0#1| 1) (div (+ oldRank0 (* (- 1) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|))) 2)) (<= 1 (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)) (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1158#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_main_~j~0#1|) (select |#length| |ULTIMATE.start_main_~#str1~0#1.base|)))) unseeded) (>= (* (- 1) |ULTIMATE.start_main_~#str2~0#1.offset|) 0))} is VALID [2022-02-21 03:58:03,411 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:58:03,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:03,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:58:03,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:58:03,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,421 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:58:03,421 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:03,458 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 5. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 28 transitions. Complement of second has 7 states. [2022-02-21 03:58:03,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:58:03,458 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:03,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. cyclomatic complexity: 5 [2022-02-21 03:58:03,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:03,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:03,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:03,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:58:03,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:03,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:03,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2022-02-21 03:58:03,460 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:58:03,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:58:03,460 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 22 transitions. cyclomatic complexity: 5 [2022-02-21 03:58:03,460 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:58:03,461 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:03,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:58:03,461 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:58:03,461 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 28 transitions. cyclomatic complexity: 6 [2022-02-21 03:58:03,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. cyclomatic complexity: 6 [2022-02-21 03:58:03,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:58:03,461 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:58:03,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:58:03,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:58:03,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:58:03,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:58:03,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:58:03,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:58:03,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 5 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:58:03,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:58:03,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 6 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:58:03,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 5 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:58:03,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:58:03,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 6 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:58:03,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:58:03,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:58:03,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:58:03,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:58:03,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:58:03,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 6 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:58:03,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 5 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:58:03,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:58:03,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:58:03,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:58:03,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:58:03,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:58:03,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:58:03,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:58:03,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:58:03,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:58:03,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:58:03,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:58:03,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,468 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:03,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2022-02-21 03:58:03,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:58:03,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:58:03,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:58:03,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. cyclomatic complexity: 6 [2022-02-21 03:58:03,470 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:58:03,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2022-02-21 03:58:03,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:58:03,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:58:03,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:58:03,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:58:03,471 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:58:03,471 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:58:03,471 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:58:03,471 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:58:03,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:58:03,472 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:58:03,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:58:03,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:58:03 BoogieIcfgContainer [2022-02-21 03:58:03,476 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:58:03,477 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:58:03,477 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:58:03,477 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:58:03,477 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:57:51" (3/4) ... [2022-02-21 03:58:03,479 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:58:03,479 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:58:03,480 INFO L158 Benchmark]: Toolchain (without parser) took 13030.46ms. Allocated memory was 88.1MB in the beginning and 172.0MB in the end (delta: 83.9MB). Free memory was 51.5MB in the beginning and 100.6MB in the end (delta: -49.1MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2022-02-21 03:58:03,480 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 88.1MB. Free memory was 68.0MB in the beginning and 67.9MB in the end (delta: 43.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:58:03,480 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.05ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 51.3MB in the beginning and 92.6MB in the end (delta: -41.3MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-02-21 03:58:03,480 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.43ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 90.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:58:03,481 INFO L158 Benchmark]: Boogie Preprocessor took 37.83ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 89.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:58:03,481 INFO L158 Benchmark]: RCFGBuilder took 261.16ms. Allocated memory is still 117.4MB. Free memory was 89.3MB in the beginning and 76.4MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:58:03,481 INFO L158 Benchmark]: BuchiAutomizer took 12475.28ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 76.4MB in the beginning and 100.6MB in the end (delta: -24.2MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2022-02-21 03:58:03,481 INFO L158 Benchmark]: Witness Printer took 2.46ms. Allocated memory is still 172.0MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:58:03,482 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.17ms. Allocated memory is still 88.1MB. Free memory was 68.0MB in the beginning and 67.9MB in the end (delta: 43.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.05ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 51.3MB in the beginning and 92.6MB in the end (delta: -41.3MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.43ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 90.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.83ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 89.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 261.16ms. Allocated memory is still 117.4MB. Free memory was 89.3MB in the beginning and 76.4MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 12475.28ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 76.4MB in the beginning and 100.6MB in the end (delta: -24.2MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * Witness Printer took 2.46ms. Allocated memory is still 172.0MB. Free memory is still 100.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 7 terminating modules (3 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * str1 + -1 * i + unknown-#length-unknown[str1] and consists of 5 locations. One deterministic module has affine ranking function 2 * i + 1 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + unknown-#length-unknown[str2] and consists of 9 locations. One deterministic module has affine ranking function 2 * j + unknown-#length-unknown[str1] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.4s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 10.7s. Construction of modules took 0.1s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 133 IncrementalHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 55 mSDtfsCounter, 133 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU3 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital248 mio100 ax100 hnf100 lsp94 ukn73 mio100 lsp44 div139 bol100 ite100 ukn100 eq167 hnf93 smp84 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:58:03,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:03,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE