./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcmp-alloca-2.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcmp-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3768a5ec02c52965864e042833cd9026b51809a0436795e6243a8a542ef62816 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:33:08,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:33:08,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:33:08,034 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:33:08,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:33:08,035 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:33:08,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:33:08,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:33:08,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:33:08,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:33:08,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:33:08,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:33:08,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:33:08,042 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:33:08,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:33:08,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:33:08,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:33:08,044 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:33:08,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:33:08,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:33:08,047 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:33:08,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:33:08,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:33:08,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:33:08,064 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:33:08,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:33:08,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:33:08,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:33:08,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:33:08,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:33:08,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:33:08,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:33:08,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:33:08,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:33:08,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:33:08,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:33:08,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:33:08,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:33:08,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:33:08,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:33:08,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:33:08,071 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:33:08,094 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:33:08,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:33:08,099 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:33:08,099 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:33:08,101 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:33:08,101 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:33:08,101 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:33:08,101 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:33:08,101 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:33:08,101 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:33:08,102 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:33:08,102 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:33:08,102 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:33:08,103 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:33:08,103 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:33:08,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:33:08,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:33:08,103 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:33:08,103 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:33:08,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:33:08,104 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:33:08,104 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:33:08,104 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:33:08,104 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:33:08,104 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:33:08,105 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:33:08,105 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:33:08,105 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:33:08,106 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:33:08,106 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3768a5ec02c52965864e042833cd9026b51809a0436795e6243a8a542ef62816 [2022-02-21 03:33:08,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:33:08,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:33:08,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:33:08,277 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:33:08,278 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:33:08,278 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcmp-alloca-2.i [2022-02-21 03:33:08,362 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a113ce165/af07768c7d9744309e6753938f1ca8e2/FLAG38b8ff431 [2022-02-21 03:33:08,718 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:33:08,718 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcmp-alloca-2.i [2022-02-21 03:33:08,726 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a113ce165/af07768c7d9744309e6753938f1ca8e2/FLAG38b8ff431 [2022-02-21 03:33:09,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a113ce165/af07768c7d9744309e6753938f1ca8e2 [2022-02-21 03:33:09,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:33:09,130 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:33:09,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:33:09,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:33:09,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:33:09,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:33:09" (1/1) ... [2022-02-21 03:33:09,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@188a15fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:09, skipping insertion in model container [2022-02-21 03:33:09,155 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:33:09" (1/1) ... [2022-02-21 03:33:09,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:33:09,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:33:09,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:33:09,612 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:33:09,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:33:09,709 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:33:09,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:09 WrapperNode [2022-02-21 03:33:09,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:33:09,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:33:09,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:33:09,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:33:09,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:09" (1/1) ... [2022-02-21 03:33:09,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:09" (1/1) ... [2022-02-21 03:33:09,801 INFO L137 Inliner]: procedures = 112, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 86 [2022-02-21 03:33:09,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:33:09,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:33:09,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:33:09,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:33:09,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:09" (1/1) ... [2022-02-21 03:33:09,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:09" (1/1) ... [2022-02-21 03:33:09,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:09" (1/1) ... [2022-02-21 03:33:09,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:09" (1/1) ... [2022-02-21 03:33:09,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:09" (1/1) ... [2022-02-21 03:33:09,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:09" (1/1) ... [2022-02-21 03:33:09,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:09" (1/1) ... [2022-02-21 03:33:09,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:33:09,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:33:09,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:33:09,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:33:09,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:09" (1/1) ... [2022-02-21 03:33:09,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:09,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:09,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:09,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:33:09,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:33:09,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:33:09,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:33:09,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:33:09,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:33:09,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:33:10,008 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:33:10,010 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:33:10,261 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:33:10,265 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:33:10,266 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-21 03:33:10,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:33:10 BoogieIcfgContainer [2022-02-21 03:33:10,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:33:10,268 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:33:10,268 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:33:10,273 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:33:10,273 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:33:10,274 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:33:09" (1/3) ... [2022-02-21 03:33:10,275 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@352bbba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:33:10, skipping insertion in model container [2022-02-21 03:33:10,275 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:33:10,277 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:09" (2/3) ... [2022-02-21 03:33:10,278 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@352bbba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:33:10, skipping insertion in model container [2022-02-21 03:33:10,278 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:33:10,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:33:10" (3/3) ... [2022-02-21 03:33:10,279 INFO L388 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrcmp-alloca-2.i [2022-02-21 03:33:10,316 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:33:10,316 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:33:10,316 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:33:10,316 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:33:10,316 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:33:10,316 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:33:10,316 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:33:10,316 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:33:10,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:10,347 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 03:33:10,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:10,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:10,351 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:33:10,351 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:33:10,351 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:33:10,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:10,354 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 03:33:10,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:10,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:10,354 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:33:10,355 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:33:10,359 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; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 12#L559true assume !(main_~length1~0#1 < 1); 16#L559-2true assume !(main_~length2~0#1 < 1); 13#L562-1true call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 9#L567-3true [2022-02-21 03:33:10,359 INFO L793 eck$LassoCheckResult]: Loop: 9#L567-3true assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 19#L567-2true main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 9#L567-3true [2022-02-21 03:33:10,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:10,363 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 03:33:10,369 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:10,370 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739498494] [2022-02-21 03:33:10,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:10,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:10,476 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:10,512 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:10,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-02-21 03:33:10,514 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:10,515 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334141551] [2022-02-21 03:33:10,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:10,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:10,538 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:10,553 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:10,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:10,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-02-21 03:33:10,555 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:10,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278567672] [2022-02-21 03:33:10,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:10,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:10,591 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:10,623 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:10,912 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:33:10,912 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:33:10,912 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:33:10,912 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:33:10,913 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:33:10,913 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:10,913 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:33:10,913 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:33:10,913 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcmp-alloca-2.i_Iteration1_Lasso [2022-02-21 03:33:10,913 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:33:10,914 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:33:10,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:10,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:11,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:11,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:11,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:11,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:11,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:11,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:11,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:11,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:11,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:11,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:11,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:33:11,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:11,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:11,472 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:33:11,475 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:33:11,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:11,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:11,491 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:11,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:11,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:33:11,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:11,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:11,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:11,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:11,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:11,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:11,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:11,516 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:11,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:11,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:11,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:11,535 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:11,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:33:11,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:11,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:11,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:11,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:11,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:11,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:11,547 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:11,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:11,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:11,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:11,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:11,576 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:11,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:33:11,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:11,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:11,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:11,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:11,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:11,589 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:11,589 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:11,605 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:11,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:11,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:11,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:11,627 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:11,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:33:11,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:11,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:11,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:11,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:11,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:11,654 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:11,654 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:11,683 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:33:11,709 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-02-21 03:33:11,709 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-02-21 03:33:11,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:11,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:11,720 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:11,772 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:33:11,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:33:11,792 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 03:33:11,792 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:33:11,792 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_1) = -1*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_1 Supporting invariants [1*ULTIMATE.start_main_~nondetString1~0#1.offset >= 0] [2022-02-21 03:33:11,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:11,871 INFO L297 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2022-02-21 03:33:11,882 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1;" "main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2022-02-21 03:33:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:11,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:11,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:33:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:11,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:11,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {29#unseeded} is VALID [2022-02-21 03:33:11,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {29#unseeded} is VALID [2022-02-21 03:33:11,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#unseeded} assume !(main_~length1~0#1 < 1); {29#unseeded} is VALID [2022-02-21 03:33:11,948 INFO L290 TraceCheckUtils]: 3: Hoare triple {29#unseeded} assume !(main_~length2~0#1 < 1); {29#unseeded} is VALID [2022-02-21 03:33:11,948 INFO L290 TraceCheckUtils]: 4: Hoare triple {29#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {79#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded (>= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 03:33:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:11,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:33:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:11,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:11,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {80#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (>= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {100#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~i~0#1| 1) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (>= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 03:33:11,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {100#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~i~0#1| 1) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (>= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {82#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))))) (>= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 03:33:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:33:12,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:12,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:33:12,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:33:12,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,016 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:33:12,017 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:12,120 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 61 transitions. Complement of second has 8 states. [2022-02-21 03:33:12,120 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:33:12,120 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:12,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:12,122 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 03:33:12,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:12,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:12,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:12,126 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:33:12,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:12,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:12,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 61 transitions. [2022-02-21 03:33:12,127 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:33:12,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:12,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:12,129 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:12,130 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 03:33:12,132 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:33:12,132 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:12,133 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:33:12,134 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:33:12,134 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 61 transitions. cyclomatic complexity: 26 [2022-02-21 03:33:12,135 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:33:12,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:33:12,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:33:12,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:33:12,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:12,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:12,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:12,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:33:12,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:33:12,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:33:12,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:33:12,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:33:12,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:33:12,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:33:12,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:33:12,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:33:12,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:33:12,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:33:12,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:33:12,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:33:12,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:33:12,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:33:12,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:33:12,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:33:12,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:33:12,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:33:12,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:33:12,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:33:12,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:33:12,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:33:12,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:33:12,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:33:12,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:33:12,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:33:12,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:33:12,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:33:12,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:33:12,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:33:12,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:33:12,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:33:12,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:33:12,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:33:12,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:33:12,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:12,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:12,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:12,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:33:12,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:33:12,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:33:12,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:33:12,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:33:12,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:33:12,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:33:12,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:33:12,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:33:12,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:33:12,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:33:12,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:33:12,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:33:12,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:33:12,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 61 transitions. cyclomatic complexity: 26 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:33:12,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,156 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:12,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-02-21 03:33:12,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:33:12,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:33:12,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:33:12,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:12,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 61 transitions. cyclomatic complexity: 26 [2022-02-21 03:33:12,164 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:33:12,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 15 states and 20 transitions. [2022-02-21 03:33:12,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:33:12,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 03:33:12,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2022-02-21 03:33:12,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:33:12,168 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-02-21 03:33:12,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2022-02-21 03:33:12,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-21 03:33:12,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:33:12,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 20 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:12,195 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 20 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:12,196 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:12,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:33:12,198 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2022-02-21 03:33:12,199 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2022-02-21 03:33:12,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:12,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:12,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states and 20 transitions. [2022-02-21 03:33:12,200 INFO L87 Difference]: Start difference. First operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states and 20 transitions. [2022-02-21 03:33:12,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:33:12,201 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2022-02-21 03:33:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2022-02-21 03:33:12,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:12,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:12,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:33:12,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:33:12,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:12,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2022-02-21 03:33:12,203 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-02-21 03:33:12,203 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-02-21 03:33:12,203 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:33:12,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2022-02-21 03:33:12,204 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:33:12,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:12,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:12,204 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:33:12,204 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:33:12,204 INFO L791 eck$LassoCheckResult]: Stem: 158#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 159#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 169#L559 assume !(main_~length1~0#1 < 1); 171#L559-2 assume !(main_~length2~0#1 < 1); 172#L562-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 165#L567-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 166#L567-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := 0; 161#L572-3 [2022-02-21 03:33:12,205 INFO L793 eck$LassoCheckResult]: Loop: 161#L572-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 160#L572-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 161#L572-3 [2022-02-21 03:33:12,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:12,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2022-02-21 03:33:12,205 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:12,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749489804] [2022-02-21 03:33:12,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:12,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:12,219 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:12,230 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:12,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:12,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:12,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2022-02-21 03:33:12,239 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:12,239 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138356017] [2022-02-21 03:33:12,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:12,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:12,244 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:12,248 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:12,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:12,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2022-02-21 03:33:12,248 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:12,249 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484763614] [2022-02-21 03:33:12,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:12,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:12,268 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:12,278 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:12,572 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:33:12,573 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:33:12,573 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:33:12,573 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:33:12,573 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:33:12,573 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:12,573 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:33:12,573 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:33:12,573 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcmp-alloca-2.i_Iteration2_Lasso [2022-02-21 03:33:12,573 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:33:12,573 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:33:12,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:12,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:12,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:12,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:12,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:12,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:12,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:12,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:12,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:12,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:12,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:12,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:12,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:13,135 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:33:13,135 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:33:13,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:13,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:13,144 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:13,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:33:13,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:13,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:13,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:13,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:13,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:13,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:13,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:13,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:13,169 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:13,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:13,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:13,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:13,187 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:13,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:33:13,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:13,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:13,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:13,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:13,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:13,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:13,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:13,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:13,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:13,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:13,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:13,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:13,219 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:33:13,220 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:33:13,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:13,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:13,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:13,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:13,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:13,228 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:13,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:13,244 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:13,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:13,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:13,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:13,280 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:33:13,281 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:33:13,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:13,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:13,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:13,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:13,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:13,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:13,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:13,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:13,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:13,308 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:33:13,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:13,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:13,309 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:33:13,310 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:33:13,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:13,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:13,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:13,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:13,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:13,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:13,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:13,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:13,349 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:33:13,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:13,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:13,350 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:33:13,358 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:33:13,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:13,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:13,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:13,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:13,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:13,366 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:13,366 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:13,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:13,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:13,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:13,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:13,408 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:33:13,425 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:33:13,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:13,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:13,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:13,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:13,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:13,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:13,442 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:13,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:13,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-02-21 03:33:13,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:13,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:13,486 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:33:13,487 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:33:13,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:13,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:13,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:13,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:13,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:13,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:13,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:13,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:13,530 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:33:13,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:13,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:13,532 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:33:13,533 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:33:13,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:13,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:13,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:13,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:13,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:13,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:13,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:13,580 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:33:13,613 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-02-21 03:33:13,613 INFO L444 ModelExtractionUtils]: 9 out of 40 variables were initially zero. Simplification set additionally 28 variables to zero. [2022-02-21 03:33:13,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:13,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:13,614 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:33:13,615 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:33:13,627 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:33:13,648 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:33:13,648 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:33:13,648 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~length2~0#1) = -1*ULTIMATE.start_main_~i~1#1 + 1*ULTIMATE.start_main_~length2~0#1 Supporting invariants [] [2022-02-21 03:33:13,664 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:33:13,720 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2022-02-21 03:33:13,723 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1;" "main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1;" [2022-02-21 03:33:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:13,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:13,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:33:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:13,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:13,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {212#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {212#unseeded} is VALID [2022-02-21 03:33:13,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {212#unseeded} is VALID [2022-02-21 03:33:13,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#unseeded} assume !(main_~length1~0#1 < 1); {212#unseeded} is VALID [2022-02-21 03:33:13,773 INFO L290 TraceCheckUtils]: 3: Hoare triple {212#unseeded} assume !(main_~length2~0#1 < 1); {212#unseeded} is VALID [2022-02-21 03:33:13,774 INFO L290 TraceCheckUtils]: 4: Hoare triple {212#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {212#unseeded} is VALID [2022-02-21 03:33:13,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#unseeded} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {212#unseeded} is VALID [2022-02-21 03:33:13,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {212#unseeded} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := 0; {212#unseeded} is VALID [2022-02-21 03:33:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:13,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:33:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:13,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:13,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {215#(>= oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|)))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; {293#(and (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length2~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|))))} is VALID [2022-02-21 03:33:13,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#(and (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length2~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|))))} main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {270#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|)))) unseeded)} is VALID [2022-02-21 03:33:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:33:13,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:13,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:33:13,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:33:13,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,809 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:33:13,809 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:13,856 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 30 transitions. Complement of second has 6 states. [2022-02-21 03:33:13,856 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:33:13,856 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:13,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2022-02-21 03:33:13,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:13,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:13,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:13,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:33:13,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:13,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:13,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2022-02-21 03:33:13,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:13,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:13,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:13,858 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2022-02-21 03:33:13,859 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:33:13,859 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:13,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:33:13,859 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:33:13,859 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 30 transitions. cyclomatic complexity: 13 [2022-02-21 03:33:13,860 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:33:13,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:33:13,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:33:13,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:33:13,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:13,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:13,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:13,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:33:13,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:33:13,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:33:13,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:33:13,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:33:13,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:33:13,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:33:13,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:33:13,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:33:13,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:33:13,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:33:13,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:33:13,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:33:13,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:33:13,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:33:13,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:33:13,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:33:13,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:33:13,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:33:13,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:33:13,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:33:13,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:33:13,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:33:13,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:33:13,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:33:13,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:33:13,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:33:13,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:13,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:13,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:13,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:33:13,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:33:13,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:33:13,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:33:13,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:33:13,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:33:13,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:33:13,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:33:13,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:33:13,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,866 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:33:13,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:33:13,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:33:13,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:33:13,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:13,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. cyclomatic complexity: 13 [2022-02-21 03:33:13,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:13,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 22 transitions. [2022-02-21 03:33:13,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:33:13,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:33:13,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2022-02-21 03:33:13,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:33:13,869 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2022-02-21 03:33:13,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2022-02-21 03:33:13,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-21 03:33:13,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:33:13,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 22 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:13,869 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 22 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:13,870 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:13,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:33:13,870 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2022-02-21 03:33:13,870 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2022-02-21 03:33:13,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:13,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:13,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 22 transitions. [2022-02-21 03:33:13,870 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 22 transitions. [2022-02-21 03:33:13,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:33:13,871 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2022-02-21 03:33:13,871 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2022-02-21 03:33:13,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:13,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:13,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:33:13,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:33:13,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:13,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2022-02-21 03:33:13,872 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2022-02-21 03:33:13,872 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2022-02-21 03:33:13,872 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:33:13,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2022-02-21 03:33:13,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:13,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:13,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:13,873 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:33:13,873 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:33:13,873 INFO L791 eck$LassoCheckResult]: Stem: 327#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 334#L559 assume !(main_~length1~0#1 < 1); 340#L559-2 assume !(main_~length2~0#1 < 1); 341#L562-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 335#L567-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 336#L567-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := 0; 342#L572-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 339#L572-4 call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset, cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcmp_#res#1;havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, cstrcmp_#t~mem6#1, cstrcmp_#t~mem3#1, cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, cstrcmp_#t~mem4#1, cstrcmp_#t~mem8#1, cstrcmp_#t~pre7#1.base, cstrcmp_#t~pre7#1.offset, cstrcmp_#t~mem9#1, cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset; 331#L551-3 [2022-02-21 03:33:13,873 INFO L793 eck$LassoCheckResult]: Loop: 331#L551-3 call cstrcmp_#t~mem3#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post2#1.base, 1 + cstrcmp_#t~post2#1.offset;call cstrcmp_#t~mem4#1 := read~int(cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, 1); 332#L551-1 assume !!(cstrcmp_#t~mem3#1 == cstrcmp_#t~mem4#1);havoc cstrcmp_#t~mem3#1;havoc cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset;havoc cstrcmp_#t~mem4#1;cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post5#1.base, 1 + cstrcmp_#t~post5#1.offset;call cstrcmp_#t~mem6#1 := read~int(cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, 1); 333#L552 assume !(0 == cstrcmp_#t~mem6#1);havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset;havoc cstrcmp_#t~mem6#1; 331#L551-3 [2022-02-21 03:33:13,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:13,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2022-02-21 03:33:13,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:13,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696459177] [2022-02-21 03:33:13,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:13,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:13,886 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:13,894 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:13,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:13,895 INFO L85 PathProgramCache]: Analyzing trace with hash 77620, now seen corresponding path program 1 times [2022-02-21 03:33:13,895 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:13,895 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038106749] [2022-02-21 03:33:13,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:13,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:13,901 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:13,905 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:13,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:13,906 INFO L85 PathProgramCache]: Analyzing trace with hash -296047681, now seen corresponding path program 1 times [2022-02-21 03:33:13,906 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:13,906 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416180309] [2022-02-21 03:33:13,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:13,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:14,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {382#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {382#true} is VALID [2022-02-21 03:33:14,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {382#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {382#true} is VALID [2022-02-21 03:33:14,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {382#true} assume !(main_~length1~0#1 < 1); {384#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 03:33:14,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {384#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} assume !(main_~length2~0#1 < 1); {384#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 03:33:14,091 INFO L290 TraceCheckUtils]: 4: Hoare triple {384#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {385#(and (or (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)))} is VALID [2022-02-21 03:33:14,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#(and (or (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {386#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))} is VALID [2022-02-21 03:33:14,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {386#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := 0; {387#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~nondetString1~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 03:33:14,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {387#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~nondetString1~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {387#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~nondetString1~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 03:33:14,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {387#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~nondetString1~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset, cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcmp_#res#1;havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, cstrcmp_#t~mem6#1, cstrcmp_#t~mem3#1, cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, cstrcmp_#t~mem4#1, cstrcmp_#t~mem8#1, cstrcmp_#t~pre7#1.base, cstrcmp_#t~pre7#1.offset, cstrcmp_#t~mem9#1, cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset; {388#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s1#1.base|) 0) 0) (= |ULTIMATE.start_cstrcmp_~s1#1.offset| 0))} is VALID [2022-02-21 03:33:14,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {388#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s1#1.base|) 0) 0) (= |ULTIMATE.start_cstrcmp_~s1#1.offset| 0))} call cstrcmp_#t~mem3#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post2#1.base, 1 + cstrcmp_#t~post2#1.offset;call cstrcmp_#t~mem4#1 := read~int(cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, 1); {388#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s1#1.base|) 0) 0) (= |ULTIMATE.start_cstrcmp_~s1#1.offset| 0))} is VALID [2022-02-21 03:33:14,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {388#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s1#1.base|) 0) 0) (= |ULTIMATE.start_cstrcmp_~s1#1.offset| 0))} assume !!(cstrcmp_#t~mem3#1 == cstrcmp_#t~mem4#1);havoc cstrcmp_#t~mem3#1;havoc cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset;havoc cstrcmp_#t~mem4#1;cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post5#1.base, 1 + cstrcmp_#t~post5#1.offset;call cstrcmp_#t~mem6#1 := read~int(cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, 1); {389#(= |ULTIMATE.start_cstrcmp_#t~mem6#1| 0)} is VALID [2022-02-21 03:33:14,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {389#(= |ULTIMATE.start_cstrcmp_#t~mem6#1| 0)} assume !(0 == cstrcmp_#t~mem6#1);havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset;havoc cstrcmp_#t~mem6#1; {383#false} is VALID [2022-02-21 03:33:14,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:33:14,110 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:33:14,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416180309] [2022-02-21 03:33:14,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416180309] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:33:14,110 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:33:14,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 03:33:14,111 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89106051] [2022-02-21 03:33:14,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:33:14,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:14,290 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:33:14,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:33:14,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:33:14,293 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:14,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:33:14,500 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-21 03:33:14,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:33:14,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:14,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:33:14,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2022-02-21 03:33:14,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:14,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 17 states and 22 transitions. [2022-02-21 03:33:14,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:33:14,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:33:14,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2022-02-21 03:33:14,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:33:14,524 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-02-21 03:33:14,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2022-02-21 03:33:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-02-21 03:33:14,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:33:14,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 22 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:14,525 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 22 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:14,525 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:33:14,526 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2022-02-21 03:33:14,526 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-02-21 03:33:14,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:14,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:14,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states and 22 transitions. [2022-02-21 03:33:14,527 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states and 22 transitions. [2022-02-21 03:33:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:33:14,527 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2022-02-21 03:33:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-02-21 03:33:14,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:14,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:14,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:33:14,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:33:14,528 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:33:14,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2022-02-21 03:33:14,529 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-02-21 03:33:14,529 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-02-21 03:33:14,529 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:33:14,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2022-02-21 03:33:14,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:14,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:14,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:14,529 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:33:14,529 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:33:14,530 INFO L791 eck$LassoCheckResult]: Stem: 421#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 422#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 428#L559 assume !(main_~length1~0#1 < 1); 434#L559-2 assume !(main_~length2~0#1 < 1); 435#L562-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 429#L567-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 430#L567-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 431#L567-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 432#L567-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := 0; 436#L572-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 433#L572-4 call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset, cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcmp_#res#1;havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, cstrcmp_#t~mem6#1, cstrcmp_#t~mem3#1, cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, cstrcmp_#t~mem4#1, cstrcmp_#t~mem8#1, cstrcmp_#t~pre7#1.base, cstrcmp_#t~pre7#1.offset, cstrcmp_#t~mem9#1, cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset; 425#L551-3 [2022-02-21 03:33:14,530 INFO L793 eck$LassoCheckResult]: Loop: 425#L551-3 call cstrcmp_#t~mem3#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post2#1.base, 1 + cstrcmp_#t~post2#1.offset;call cstrcmp_#t~mem4#1 := read~int(cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, 1); 426#L551-1 assume !!(cstrcmp_#t~mem3#1 == cstrcmp_#t~mem4#1);havoc cstrcmp_#t~mem3#1;havoc cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset;havoc cstrcmp_#t~mem4#1;cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post5#1.base, 1 + cstrcmp_#t~post5#1.offset;call cstrcmp_#t~mem6#1 := read~int(cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, 1); 427#L552 assume !(0 == cstrcmp_#t~mem6#1);havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset;havoc cstrcmp_#t~mem6#1; 425#L551-3 [2022-02-21 03:33:14,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:14,530 INFO L85 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2022-02-21 03:33:14,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:14,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975086581] [2022-02-21 03:33:14,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:14,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:14,545 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:14,554 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:14,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:14,554 INFO L85 PathProgramCache]: Analyzing trace with hash 77620, now seen corresponding path program 2 times [2022-02-21 03:33:14,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:14,554 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146570048] [2022-02-21 03:33:14,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:14,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:14,561 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:14,565 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:14,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:14,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1311502365, now seen corresponding path program 1 times [2022-02-21 03:33:14,565 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:14,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749645077] [2022-02-21 03:33:14,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:14,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:14,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {478#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {478#true} is VALID [2022-02-21 03:33:14,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {478#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {478#true} is VALID [2022-02-21 03:33:14,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {478#true} assume !(main_~length1~0#1 < 1); {478#true} is VALID [2022-02-21 03:33:14,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {478#true} assume !(main_~length2~0#1 < 1); {480#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} is VALID [2022-02-21 03:33:14,739 INFO L290 TraceCheckUtils]: 4: Hoare triple {480#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {481#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)) (or (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0)))} is VALID [2022-02-21 03:33:14,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {481#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)) (or (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0)))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {481#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)) (or (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0)))} is VALID [2022-02-21 03:33:14,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {481#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)) (or (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0)))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {481#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)) (or (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0)))} is VALID [2022-02-21 03:33:14,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {481#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)) (or (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0)))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {481#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)) (or (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0)))} is VALID [2022-02-21 03:33:14,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {481#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)) (or (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0)))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := 0; {482#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (or (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0)))} is VALID [2022-02-21 03:33:14,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {482#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (or (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0)))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {483#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~length2~0#1| 1) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 03:33:14,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {483#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~length2~0#1| 1) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset, cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcmp_#res#1;havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, cstrcmp_#t~mem6#1, cstrcmp_#t~mem3#1, cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, cstrcmp_#t~mem4#1, cstrcmp_#t~mem8#1, cstrcmp_#t~pre7#1.base, cstrcmp_#t~pre7#1.offset, cstrcmp_#t~mem9#1, cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset; {484#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s2#1.base|) |ULTIMATE.start_cstrcmp_~s2#1.offset|) 0) (= |ULTIMATE.start_cstrcmp_~s1#1.offset| 0))} is VALID [2022-02-21 03:33:14,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {484#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s2#1.base|) |ULTIMATE.start_cstrcmp_~s2#1.offset|) 0) (= |ULTIMATE.start_cstrcmp_~s1#1.offset| 0))} call cstrcmp_#t~mem3#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post2#1.base, 1 + cstrcmp_#t~post2#1.offset;call cstrcmp_#t~mem4#1 := read~int(cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, 1); {485#(and (= |ULTIMATE.start_cstrcmp_#t~mem4#1| 0) (= |ULTIMATE.start_cstrcmp_#t~mem3#1| (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s1#1.base|) |ULTIMATE.start_cstrcmp_~s1#1.offset|)) (= |ULTIMATE.start_cstrcmp_~s1#1.offset| 0))} is VALID [2022-02-21 03:33:14,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {485#(and (= |ULTIMATE.start_cstrcmp_#t~mem4#1| 0) (= |ULTIMATE.start_cstrcmp_#t~mem3#1| (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s1#1.base|) |ULTIMATE.start_cstrcmp_~s1#1.offset|)) (= |ULTIMATE.start_cstrcmp_~s1#1.offset| 0))} assume !!(cstrcmp_#t~mem3#1 == cstrcmp_#t~mem4#1);havoc cstrcmp_#t~mem3#1;havoc cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset;havoc cstrcmp_#t~mem4#1;cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post5#1.base, 1 + cstrcmp_#t~post5#1.offset;call cstrcmp_#t~mem6#1 := read~int(cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, 1); {486#(= |ULTIMATE.start_cstrcmp_#t~mem6#1| 0)} is VALID [2022-02-21 03:33:14,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {486#(= |ULTIMATE.start_cstrcmp_#t~mem6#1| 0)} assume !(0 == cstrcmp_#t~mem6#1);havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset;havoc cstrcmp_#t~mem6#1; {479#false} is VALID [2022-02-21 03:33:14,746 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:33:14,746 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:33:14,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749645077] [2022-02-21 03:33:14,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749645077] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:33:14,746 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:33:14,746 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-21 03:33:14,746 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600543997] [2022-02-21 03:33:14,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:33:14,920 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:33:14,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 03:33:14,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:33:14,921 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:15,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:33:15,120 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-21 03:33:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:33:15,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:15,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:33:15,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2022-02-21 03:33:15,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:15,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 21 transitions. [2022-02-21 03:33:15,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:33:15,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:33:15,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2022-02-21 03:33:15,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:33:15,135 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-02-21 03:33:15,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2022-02-21 03:33:15,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-02-21 03:33:15,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:33:15,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 21 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:15,136 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 21 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:15,136 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:15,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:33:15,136 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-02-21 03:33:15,137 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-02-21 03:33:15,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:15,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:15,137 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states and 21 transitions. [2022-02-21 03:33:15,137 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states and 21 transitions. [2022-02-21 03:33:15,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:33:15,137 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-02-21 03:33:15,138 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-02-21 03:33:15,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:15,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:15,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:33:15,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:33:15,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:15,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-02-21 03:33:15,142 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-02-21 03:33:15,142 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-02-21 03:33:15,142 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:33:15,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2022-02-21 03:33:15,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:15,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:15,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:15,143 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:33:15,143 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:33:15,143 INFO L791 eck$LassoCheckResult]: Stem: 514#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 515#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 521#L559 assume !(main_~length1~0#1 < 1); 527#L559-2 assume !(main_~length2~0#1 < 1); 528#L562-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 522#L567-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 523#L567-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 524#L567-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 525#L567-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := 0; 529#L572-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 516#L572-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 517#L572-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 526#L572-4 call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset, cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcmp_#res#1;havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, cstrcmp_#t~mem6#1, cstrcmp_#t~mem3#1, cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, cstrcmp_#t~mem4#1, cstrcmp_#t~mem8#1, cstrcmp_#t~pre7#1.base, cstrcmp_#t~pre7#1.offset, cstrcmp_#t~mem9#1, cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset; 520#L551-3 [2022-02-21 03:33:15,143 INFO L793 eck$LassoCheckResult]: Loop: 520#L551-3 call cstrcmp_#t~mem3#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post2#1.base, 1 + cstrcmp_#t~post2#1.offset;call cstrcmp_#t~mem4#1 := read~int(cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, 1); 518#L551-1 assume !!(cstrcmp_#t~mem3#1 == cstrcmp_#t~mem4#1);havoc cstrcmp_#t~mem3#1;havoc cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset;havoc cstrcmp_#t~mem4#1;cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post5#1.base, 1 + cstrcmp_#t~post5#1.offset;call cstrcmp_#t~mem6#1 := read~int(cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, 1); 519#L552 assume !(0 == cstrcmp_#t~mem6#1);havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset;havoc cstrcmp_#t~mem6#1; 520#L551-3 [2022-02-21 03:33:15,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:15,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2022-02-21 03:33:15,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:15,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684354934] [2022-02-21 03:33:15,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:15,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:15,173 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:15,181 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:15,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:15,181 INFO L85 PathProgramCache]: Analyzing trace with hash 77620, now seen corresponding path program 3 times [2022-02-21 03:33:15,181 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:15,182 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839708206] [2022-02-21 03:33:15,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:15,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:15,186 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:15,190 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:15,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:15,190 INFO L85 PathProgramCache]: Analyzing trace with hash -718433093, now seen corresponding path program 1 times [2022-02-21 03:33:15,190 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:15,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636883522] [2022-02-21 03:33:15,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:15,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:15,209 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:15,221 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:16,039 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:33:16,039 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:33:16,040 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:33:16,040 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:33:16,040 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:33:16,040 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:16,040 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:33:16,040 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:33:16,040 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcmp-alloca-2.i_Iteration5_Lasso [2022-02-21 03:33:16,040 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:33:16,040 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:33:16,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,754 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:33:16,756 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:33:16,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:16,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:17,463 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:33:17,463 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:33:17,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:17,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:17,465 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:33:17,466 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:33:17,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:17,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:17,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:17,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:17,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:17,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:17,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:17,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:17,496 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:33:17,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:17,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:17,497 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:33:17,499 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:33:17,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:17,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:17,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:17,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:17,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:17,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:17,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:17,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:17,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:17,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:17,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:17,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:17,523 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:33:17,524 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:33:17,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:17,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:17,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:17,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:17,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:17,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:17,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:17,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:17,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:17,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:17,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:17,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:17,551 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:33:17,553 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:33:17,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:17,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:17,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:17,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:17,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:17,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:17,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:17,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:17,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:17,591 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:33:17,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:17,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:17,592 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:33:17,593 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:33:17,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:17,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:17,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:17,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:17,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:17,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:17,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:17,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:17,602 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:17,617 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:33:17,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:17,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:17,619 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:33:17,619 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:33:17,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:17,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:17,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:17,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:17,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:17,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:17,627 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:17,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:17,628 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:17,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 03:33:17,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:17,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:17,644 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:33:17,645 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:33:17,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:17,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:17,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:17,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:17,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:17,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:17,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:17,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:17,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:17,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 03:33:17,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:17,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:17,669 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:33:17,676 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:33:17,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:17,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:17,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:17,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:17,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:17,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:17,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:17,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:17,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:17,703 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:33:17,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:17,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:17,705 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:33:17,705 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:33:17,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:17,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:17,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:17,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:17,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:17,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:17,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:17,735 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:17,750 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:33:17,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:17,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:17,752 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:33:17,754 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:33:17,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:17,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:17,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:17,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:17,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:17,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:17,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:17,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:17,762 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:17,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 03:33:17,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:17,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:17,780 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:33:17,781 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:33:17,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:17,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:17,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:17,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:17,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:17,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:17,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:17,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:17,804 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:17,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 03:33:17,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:17,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:17,821 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:33:17,821 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:33:17,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:17,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:17,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:17,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:17,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:17,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:17,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:17,879 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:33:17,918 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2022-02-21 03:33:17,918 INFO L444 ModelExtractionUtils]: 14 out of 55 variables were initially zero. Simplification set additionally 38 variables to zero. [2022-02-21 03:33:17,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:17,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:17,923 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:33:17,925 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:33:17,925 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:33:17,931 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:33:17,931 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:33:17,931 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_2, ULTIMATE.start_cstrcmp_~s1#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_2 - 1*ULTIMATE.start_cstrcmp_~s1#1.offset Supporting invariants [] [2022-02-21 03:33:17,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:18,121 INFO L297 tatePredicateManager]: 25 out of 28 supporting invariants were superfluous and have been removed [2022-02-21 03:33:18,129 INFO L390 LassoCheck]: Loop: "call cstrcmp_#t~mem3#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post2#1.base, 1 + cstrcmp_#t~post2#1.offset;call cstrcmp_#t~mem4#1 := read~int(cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, 1);" "assume !!(cstrcmp_#t~mem3#1 == cstrcmp_#t~mem4#1);havoc cstrcmp_#t~mem3#1;havoc cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset;havoc cstrcmp_#t~mem4#1;cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post5#1.base, 1 + cstrcmp_#t~post5#1.offset;call cstrcmp_#t~mem6#1 := read~int(cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, 1);" "assume !(0 == cstrcmp_#t~mem6#1);havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset;havoc cstrcmp_#t~mem6#1;" [2022-02-21 03:33:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:18,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:18,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 03:33:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:18,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:18,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {573#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {573#unseeded} is VALID [2022-02-21 03:33:18,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {573#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {573#unseeded} is VALID [2022-02-21 03:33:18,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {573#unseeded} assume !(main_~length1~0#1 < 1); {573#unseeded} is VALID [2022-02-21 03:33:18,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {573#unseeded} assume !(main_~length2~0#1 < 1); {573#unseeded} is VALID [2022-02-21 03:33:18,289 INFO L290 TraceCheckUtils]: 4: Hoare triple {573#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {750#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:33:18,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {750#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {750#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:33:18,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {750#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {750#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:33:18,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {750#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {750#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:33:18,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {750#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := 0; {750#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:33:18,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {750#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; {750#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:33:18,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {750#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {750#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:33:18,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {750#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {750#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:33:18,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {750#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) unseeded (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset, cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcmp_#res#1;havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, cstrcmp_#t~mem6#1, cstrcmp_#t~mem3#1, cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, cstrcmp_#t~mem4#1, cstrcmp_#t~mem8#1, cstrcmp_#t~pre7#1.base, cstrcmp_#t~pre7#1.offset, cstrcmp_#t~mem9#1, cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset; {729#(and (= |ULTIMATE.start_cstrcmp_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) unseeded (= |ULTIMATE.start_cstrcmp_~s2#1.offset| |ULTIMATE.start_cstrcmp_~s1#1.offset|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:33:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:18,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:33:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:18,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:18,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {730#(and (= |ULTIMATE.start_cstrcmp_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (= |ULTIMATE.start_cstrcmp_~s2#1.offset| |ULTIMATE.start_cstrcmp_~s1#1.offset|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcmp_~s1#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrcmp_#t~mem3#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post2#1.base, 1 + cstrcmp_#t~post2#1.offset;call cstrcmp_#t~mem4#1 := read~int(cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset, 1); {775#(and (<= |ULTIMATE.start_cstrcmp_~s2#1.offset| (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|)) (= |ULTIMATE.start_cstrcmp_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcmp_~s1#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (= (+ (- 1) |ULTIMATE.start_cstrcmp_~s2#1.offset|) |ULTIMATE.start_cstrcmp_~s1#1.offset|))} is VALID [2022-02-21 03:33:18,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {775#(and (<= |ULTIMATE.start_cstrcmp_~s2#1.offset| (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|)) (= |ULTIMATE.start_cstrcmp_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcmp_~s1#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (= (+ (- 1) |ULTIMATE.start_cstrcmp_~s2#1.offset|) |ULTIMATE.start_cstrcmp_~s1#1.offset|))} assume !!(cstrcmp_#t~mem3#1 == cstrcmp_#t~mem4#1);havoc cstrcmp_#t~mem3#1;havoc cstrcmp_#t~post2#1.base, cstrcmp_#t~post2#1.offset;havoc cstrcmp_#t~mem4#1;cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post5#1.base, 1 + cstrcmp_#t~post5#1.offset;call cstrcmp_#t~mem6#1 := read~int(cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset, 1); {779#(and (<= |ULTIMATE.start_cstrcmp_~s2#1.offset| (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|)) (= |ULTIMATE.start_cstrcmp_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (= |ULTIMATE.start_cstrcmp_~s2#1.offset| |ULTIMATE.start_cstrcmp_~s1#1.offset|) (<= (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) 1) (+ oldRank0 |ULTIMATE.start_cstrcmp_~s2#1.offset|)) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:33:18,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {779#(and (<= |ULTIMATE.start_cstrcmp_~s2#1.offset| (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|)) (= |ULTIMATE.start_cstrcmp_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (= |ULTIMATE.start_cstrcmp_~s2#1.offset| |ULTIMATE.start_cstrcmp_~s1#1.offset|) (<= (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) 1) (+ oldRank0 |ULTIMATE.start_cstrcmp_~s2#1.offset|)) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !(0 == cstrcmp_#t~mem6#1);havoc cstrcmp_#t~post5#1.base, cstrcmp_#t~post5#1.offset;havoc cstrcmp_#t~mem6#1; {732#(and (= |ULTIMATE.start_cstrcmp_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (= |ULTIMATE.start_cstrcmp_~s2#1.offset| |ULTIMATE.start_cstrcmp_~s1#1.offset|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcmp_~s1#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:33:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:33:18,399 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:33:18,411 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:33:18,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:33:18,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,412 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:33:18,412 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:18,462 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 20 states and 24 transitions. Complement of second has 7 states. [2022-02-21 03:33:18,462 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:33:18,462 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:18,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. cyclomatic complexity: 7 [2022-02-21 03:33:18,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:18,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:18,463 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:33:18,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:18,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:18,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:18,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2022-02-21 03:33:18,465 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:33:18,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:33:18,466 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 20 transitions. cyclomatic complexity: 7 [2022-02-21 03:33:18,470 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:33:18,470 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:33:18,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:18,472 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:33:18,472 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 24 transitions. cyclomatic complexity: 7 [2022-02-21 03:33:18,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. cyclomatic complexity: 7 [2022-02-21 03:33:18,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:33:18,473 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:33:18,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:33:18,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:33:18,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:33:18,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:33:18,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,474 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:33:18,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:33:18,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:33:18,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,474 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:33:18,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:33:18,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:33:18,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:33:18,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:33:18,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:33:18,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,476 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:33:18,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:33:18,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:33:18,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:33:18,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:33:18,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:33:18,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:33:18,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:33:18,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:33:18,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:33:18,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:33:18,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:33:18,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,479 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:33:18,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:33:18,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,479 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:18,479 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:33:18,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-02-21 03:33:18,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:33:18,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:33:18,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:33:18,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:18,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. cyclomatic complexity: 7 [2022-02-21 03:33:18,481 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:33:18,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2022-02-21 03:33:18,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:33:18,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:33:18,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:33:18,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:33:18,482 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:33:18,482 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:33:18,482 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:33:18,482 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:33:18,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:33:18,482 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:33:18,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:33:18,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:33:18 BoogieIcfgContainer [2022-02-21 03:33:18,495 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:33:18,495 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:33:18,495 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:33:18,495 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:33:18,496 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:33:10" (3/4) ... [2022-02-21 03:33:18,497 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:33:18,497 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:33:18,498 INFO L158 Benchmark]: Toolchain (without parser) took 9367.83ms. Allocated memory was 83.9MB in the beginning and 151.0MB in the end (delta: 67.1MB). Free memory was 54.5MB in the beginning and 121.2MB in the end (delta: -66.7MB). Peak memory consumption was 1.2MB. Max. memory is 16.1GB. [2022-02-21 03:33:18,498 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 67.1MB. Free memory was 38.4MB in the beginning and 38.3MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:33:18,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.93ms. Allocated memory is still 83.9MB. Free memory was 54.3MB in the beginning and 48.9MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:33:18,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.09ms. Allocated memory is still 83.9MB. Free memory was 48.9MB in the beginning and 46.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:33:18,499 INFO L158 Benchmark]: Boogie Preprocessor took 54.83ms. Allocated memory is still 83.9MB. Free memory was 46.8MB in the beginning and 45.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:33:18,499 INFO L158 Benchmark]: RCFGBuilder took 409.32ms. Allocated memory is still 83.9MB. Free memory was 45.1MB in the beginning and 57.8MB in the end (delta: -12.7MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2022-02-21 03:33:18,500 INFO L158 Benchmark]: BuchiAutomizer took 8226.82ms. Allocated memory was 83.9MB in the beginning and 151.0MB in the end (delta: 67.1MB). Free memory was 57.8MB in the beginning and 121.2MB in the end (delta: -63.4MB). Peak memory consumption was 84.2MB. Max. memory is 16.1GB. [2022-02-21 03:33:18,500 INFO L158 Benchmark]: Witness Printer took 2.35ms. Allocated memory is still 151.0MB. Free memory is still 121.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:33:18,501 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2022-02-21 03:33:18,508 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 --- 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.13ms. Allocated memory is still 67.1MB. Free memory was 38.4MB in the beginning and 38.3MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 575.93ms. Allocated memory is still 83.9MB. Free memory was 54.3MB in the beginning and 48.9MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.09ms. Allocated memory is still 83.9MB. Free memory was 48.9MB in the beginning and 46.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.83ms. Allocated memory is still 83.9MB. Free memory was 46.8MB in the beginning and 45.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 409.32ms. Allocated memory is still 83.9MB. Free memory was 45.1MB in the beginning and 57.8MB in the end (delta: -12.7MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 8226.82ms. Allocated memory was 83.9MB in the beginning and 151.0MB in the end (delta: 67.1MB). Free memory was 57.8MB in the beginning and 121.2MB in the end (delta: -63.4MB). Peak memory consumption was 84.2MB. Max. memory is 16.1GB. * Witness Printer took 2.35ms. Allocated memory is still 151.0MB. Free memory is still 121.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function length2 + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[nondetString2] and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.1s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 6.8s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 150 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 146 IncrementalHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 56 mSDtfsCounter, 146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital178 mio100 ax111 hnf100 lsp84 ukn88 mio100 lsp55 div100 bol100 ite100 ukn100 eq175 hnf90 smp96 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:33:18,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE