./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bfd8ca9d9dda86f57445168715d124831c95b647e7c1b1093bb129b0384cce9e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:34:47,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:34:47,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:34:47,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:34:47,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:34:47,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:34:47,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:34:47,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:34:47,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:34:47,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:34:47,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:34:47,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:34:47,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:34:47,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:34:47,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:34:47,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:34:47,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:34:47,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:34:47,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:34:47,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:34:47,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:34:47,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:34:47,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:34:47,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:34:47,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:34:47,513 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:34:47,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:34:47,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:34:47,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:34:47,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:34:47,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:34:47,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:34:47,517 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:34:47,518 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:34:47,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:34:47,519 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:34:47,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:34:47,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:34:47,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:34:47,521 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:34:47,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:34:47,523 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:34:47,551 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:34:47,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:34:47,552 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:34:47,552 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:34:47,553 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:34:47,553 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:34:47,553 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:34:47,553 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:34:47,553 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:34:47,554 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:34:47,554 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:34:47,555 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:34:47,555 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:34:47,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:34:47,555 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:34:47,555 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:34:47,556 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:34:47,556 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:34:47,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:34:47,556 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:34:47,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:34:47,556 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:34:47,556 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:34:47,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:34:47,557 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:34:47,557 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:34:47,557 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:34:47,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:34:47,557 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:34:47,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:34:47,558 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:34:47,559 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:34:47,559 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bfd8ca9d9dda86f57445168715d124831c95b647e7c1b1093bb129b0384cce9e [2022-02-21 04:34:47,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:34:47,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:34:47,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:34:47,811 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:34:47,812 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:34:47,813 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i [2022-02-21 04:34:47,873 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d1da48e1/1b53f061cb004e0f93cf0f3498368843/FLAG2ca22e00b [2022-02-21 04:34:48,306 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:34:48,307 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i [2022-02-21 04:34:48,316 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d1da48e1/1b53f061cb004e0f93cf0f3498368843/FLAG2ca22e00b [2022-02-21 04:34:48,675 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d1da48e1/1b53f061cb004e0f93cf0f3498368843 [2022-02-21 04:34:48,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:34:48,681 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:34:48,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:34:48,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:34:48,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:34:48,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:34:48" (1/1) ... [2022-02-21 04:34:48,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b522113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:48, skipping insertion in model container [2022-02-21 04:34:48,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:34:48" (1/1) ... [2022-02-21 04:34:48,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:34:48,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:34:48,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:34:48,979 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:34:49,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:34:49,036 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:34:49,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49 WrapperNode [2022-02-21 04:34:49,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:34:49,039 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:34:49,039 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:34:49,039 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:34:49,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,090 INFO L137 Inliner]: procedures = 117, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 89 [2022-02-21 04:34:49,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:34:49,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:34:49,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:34:49,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:34:49,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:34:49,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:34:49,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:34:49,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:34:49,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:49,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:49,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:49,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:34:49,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:34:49,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:34:49,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:34:49,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:34:49,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:34:49,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:34:49,326 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:34:49,327 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:34:49,536 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:34:49,542 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:34:49,544 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-21 04:34:49,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:34:49 BoogieIcfgContainer [2022-02-21 04:34:49,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:34:49,546 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:34:49,548 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:34:49,551 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:34:49,553 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:49,553 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:34:48" (1/3) ... [2022-02-21 04:34:49,554 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6609dfa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:34:49, skipping insertion in model container [2022-02-21 04:34:49,554 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:49,554 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (2/3) ... [2022-02-21 04:34:49,555 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6609dfa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:34:49, skipping insertion in model container [2022-02-21 04:34:49,555 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:49,555 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:34:49" (3/3) ... [2022-02-21 04:34:49,556 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrcat-alloca-2.i [2022-02-21 04:34:49,589 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:34:49,589 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:34:49,589 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:34:49,589 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:34:49,590 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:34:49,590 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:34:49,590 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:34:49,590 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:34:49,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:49,635 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-02-21 04:34:49,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:49,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:49,640 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:34:49,640 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:49,640 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:34:49,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:49,646 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-02-21 04:34:49,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:49,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:49,646 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:34:49,647 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:49,651 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 14#L527true assume !(main_~length1~0#1 < 1); 17#L527-2true assume !(main_~length2~0#1 < 2); 18#L530-1true assume !(main_~length3~0#1 < 1); 13#L533-1true assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 9#L540-3true [2022-02-21 04:34:49,652 INFO L793 eck$LassoCheckResult]: Loop: 9#L540-3true assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 16#L540-2true main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 9#L540-3true [2022-02-21 04:34:49,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:49,656 INFO L85 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2022-02-21 04:34:49,662 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:49,662 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104772137] [2022-02-21 04:34:49,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:49,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:49,757 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:49,800 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:49,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:49,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2019, now seen corresponding path program 1 times [2022-02-21 04:34:49,803 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:49,803 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826883452] [2022-02-21 04:34:49,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:49,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:49,825 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:49,838 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:49,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:49,840 INFO L85 PathProgramCache]: Analyzing trace with hash 180553841, now seen corresponding path program 1 times [2022-02-21 04:34:49,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:49,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312601814] [2022-02-21 04:34:49,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:49,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:49,879 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:49,912 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:50,308 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:34:50,309 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:34:50,323 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:34:50,323 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:34:50,324 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:34:50,324 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:50,324 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:34:50,324 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:34:50,325 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration1_Lasso [2022-02-21 04:34:50,325 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:34:50,325 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:34:50,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:51,077 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:34:51,080 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:34:51,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,084 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:51,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:51,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:51,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:34:51,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,144 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:51,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:51,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:51,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 04:34:51,164 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,185 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:34:51,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:51,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:51,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:51,218 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,245 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 04:34:51,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,270 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,271 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,286 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,307 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:34:51,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,367 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:51,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:51,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:51,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:34:51,405 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,423 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:34:51,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:51,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:51,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:51,458 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,478 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:34:51,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,490 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,505 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,527 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:34:51,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,552 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,552 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,599 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:51,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:51,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:51,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 04:34:51,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,634 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 04:34:51,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:51,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:51,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:51,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,672 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 04:34:51,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,718 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:34:51,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,736 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,736 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,738 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-02-21 04:34:51,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,757 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:34:51,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,810 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:34:51,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,827 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,827 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,846 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:34:51,865 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-02-21 04:34:51,866 INFO L444 ModelExtractionUtils]: 9 out of 31 variables were initially zero. Simplification set additionally 19 variables to zero. [2022-02-21 04:34:51,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,888 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:51,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:34:51,904 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:34:51,947 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:34:51,948 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:34:51,948 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~length1~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 04:34:51,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:52,024 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 04:34:52,037 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1;" "main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1;" [2022-02-21 04:34:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:52,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:52,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:34:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:52,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:52,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {31#unseeded} is VALID [2022-02-21 04:34:52,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {31#unseeded} is VALID [2022-02-21 04:34:52,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#unseeded} assume !(main_~length1~0#1 < 1); {31#unseeded} is VALID [2022-02-21 04:34:52,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {31#unseeded} assume !(main_~length2~0#1 < 2); {31#unseeded} is VALID [2022-02-21 04:34:52,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {31#unseeded} assume !(main_~length3~0#1 < 1); {31#unseeded} is VALID [2022-02-21 04:34:52,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#unseeded} assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; {31#unseeded} is VALID [2022-02-21 04:34:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:52,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:34:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:52,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:52,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(>= oldRank0 (+ |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; {94#(and (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~length1~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~i~0#1|))))} is VALID [2022-02-21 04:34:52,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {94#(and (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~length1~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~i~0#1|))))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {74#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~i~0#1|)))) unseeded)} is VALID [2022-02-21 04:34:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:52,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:52,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:34:52,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,185 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:34:52,186 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 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.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,256 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 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.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 52 states and 74 transitions. Complement of second has 7 states. [2022-02-21 04:34:52,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:34:52,257 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:52,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,259 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-02-21 04:34:52,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:52,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:52,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,262 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:34:52,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:52,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:52,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 74 transitions. [2022-02-21 04:34:52,263 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-02-21 04:34:52,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:52,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:52,265 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,266 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-02-21 04:34:52,267 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 04:34:52,268 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,269 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:34:52,270 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:34:52,270 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 52 states and 74 transitions. cyclomatic complexity: 32 [2022-02-21 04:34:52,271 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 04:34:52,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:34:52,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:34:52,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:34:52,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:52,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:52,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:52,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:52,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:52,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:52,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 52 letters. [2022-02-21 04:34:52,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 52 letters. [2022-02-21 04:34:52,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 52 letters. Loop has 52 letters. [2022-02-21 04:34:52,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 21 letters. [2022-02-21 04:34:52,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 21 letters. [2022-02-21 04:34:52,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 21 letters. [2022-02-21 04:34:52,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:34:52,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:34:52,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:34:52,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 2 letters. [2022-02-21 04:34:52,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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 2 letters. [2022-02-21 04:34:52,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:34:52,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:34:52,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:34:52,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:34:52,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 2 letters. [2022-02-21 04:34:52,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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 2 letters. [2022-02-21 04:34:52,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:34:52,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 2 letters. [2022-02-21 04:34:52,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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 2 letters. [2022-02-21 04:34:52,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:34:52,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:52,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:52,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:52,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:34:52,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:34:52,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:34:52,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:34:52,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:34:52,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:34:52,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:52,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:52,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:52,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:34:52,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:34:52,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:34:52,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:52,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:52,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:52,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 2 letters. [2022-02-21 04:34:52,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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 2 letters. [2022-02-21 04:34:52,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:34:52,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:34:52,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:34:52,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:34:52,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 2 letters. [2022-02-21 04:34:52,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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 2 letters. [2022-02-21 04:34:52,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:34:52,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 2 letters. [2022-02-21 04:34:52,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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 2 letters. [2022-02-21 04:34:52,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:34:52,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:34:52,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:34:52,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:34:52,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:52,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:52,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:52,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,293 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:52,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-02-21 04:34:52,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:34:52,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:52,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:34:52,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 74 transitions. cyclomatic complexity: 32 [2022-02-21 04:34:52,301 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-02-21 04:34:52,304 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 17 states and 24 transitions. [2022-02-21 04:34:52,304 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 04:34:52,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 04:34:52,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2022-02-21 04:34:52,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:52,315 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2022-02-21 04:34:52,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2022-02-21 04:34:52,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-21 04:34:52,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:52,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 24 transitions. Second operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,351 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 24 transitions. Second operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,353 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. Second operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:52,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:52,358 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2022-02-21 04:34:52,358 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2022-02-21 04:34:52,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:52,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:52,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 transitions. [2022-02-21 04:34:52,359 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 transitions. [2022-02-21 04:34:52,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:52,361 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2022-02-21 04:34:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2022-02-21 04:34:52,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:52,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:52,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:52,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:52,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2022-02-21 04:34:52,364 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2022-02-21 04:34:52,364 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2022-02-21 04:34:52,364 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:34:52,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2022-02-21 04:34:52,365 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-02-21 04:34:52,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:52,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:52,365 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:34:52,365 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:52,365 INFO L791 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 164#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 167#L527 assume !(main_~length1~0#1 < 1); 175#L527-2 assume !(main_~length2~0#1 < 2); 176#L530-1 assume !(main_~length3~0#1 < 1); 174#L533-1 assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 170#L540-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 172#L540-4 main_~i~1#1 := 0; 160#L545-3 [2022-02-21 04:34:52,366 INFO L793 eck$LassoCheckResult]: Loop: 160#L545-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 162#L545-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 160#L545-3 [2022-02-21 04:34:52,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:52,366 INFO L85 PathProgramCache]: Analyzing trace with hash 180553783, now seen corresponding path program 1 times [2022-02-21 04:34:52,366 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:52,367 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856466570] [2022-02-21 04:34:52,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:52,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,380 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,387 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:52,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:52,388 INFO L85 PathProgramCache]: Analyzing trace with hash 2467, now seen corresponding path program 1 times [2022-02-21 04:34:52,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:52,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613028579] [2022-02-21 04:34:52,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:52,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,393 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,396 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:52,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:52,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1713495129, now seen corresponding path program 1 times [2022-02-21 04:34:52,396 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:52,397 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821207070] [2022-02-21 04:34:52,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:52,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,410 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,419 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:52,660 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:34:52,661 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:34:52,661 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:34:52,661 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:34:52,661 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:34:52,661 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:52,661 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:34:52,661 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:34:52,661 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration2_Lasso [2022-02-21 04:34:52,661 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:34:52,661 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:34:52,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:52,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:52,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:52,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:52,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:52,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:52,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:52,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:52,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:52,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:52,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:52,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:52,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:52,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:52,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:52,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,172 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:34:53,173 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:34:53,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:53,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:53,174 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:53,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:34:53,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:53,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:53,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:53,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:53,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:53,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:53,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:53,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:53,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:53,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:53,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:53,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:53,232 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:53,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:34:53,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:53,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:53,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:53,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:53,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:53,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:53,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:53,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:53,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:53,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:53,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:53,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:53,308 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:53,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:53,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:53,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:53,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:53,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:53,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:53,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:53,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:53,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:34:53,339 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:53,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:53,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:53,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:53,361 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:53,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 04:34:53,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:53,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:53,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:53,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:53,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:53,386 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:53,386 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:53,401 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:53,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:53,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:53,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:53,436 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:53,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 04:34:53,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:53,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:53,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:53,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:53,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:53,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:53,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:53,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:53,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:53,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:53,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:53,493 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:53,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 04:34:53,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:53,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:53,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:53,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:53,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:53,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:53,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:53,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:53,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:53,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:53,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:53,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:53,546 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:53,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 04:34:53,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:53,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:53,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:53,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:53,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:53,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:53,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:53,579 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:34:53,593 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-02-21 04:34:53,594 INFO L444 ModelExtractionUtils]: 22 out of 34 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-02-21 04:34:53,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:53,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:53,595 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:53,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 04:34:53,609 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:34:53,617 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:34:53,617 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:34:53,617 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nondetString2~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11#1.base)_2, ULTIMATE.start_main_~i~1#1) = -1*ULTIMATE.start_main_~nondetString2~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11#1.base)_2 - 1*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2022-02-21 04:34:53,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:53,665 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 04:34:53,669 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1;" "main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2022-02-21 04:34:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:53,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:53,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:34:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:53,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:53,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {220#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {220#unseeded} is VALID [2022-02-21 04:34:53,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {220#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {220#unseeded} is VALID [2022-02-21 04:34:53,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {220#unseeded} assume !(main_~length1~0#1 < 1); {220#unseeded} is VALID [2022-02-21 04:34:53,721 INFO L290 TraceCheckUtils]: 3: Hoare triple {220#unseeded} assume !(main_~length2~0#1 < 2); {220#unseeded} is VALID [2022-02-21 04:34:53,721 INFO L290 TraceCheckUtils]: 4: Hoare triple {220#unseeded} assume !(main_~length3~0#1 < 1); {220#unseeded} is VALID [2022-02-21 04:34:53,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {220#unseeded} assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; {264#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 04:34:53,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {264#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {264#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 04:34:53,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {264#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} main_~i~1#1 := 0; {264#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 04:34:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:53,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 04:34:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:53,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:53,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {265#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc11#1.base|) (* (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset|) (* (- 1) |ULTIMATE.start_main_~i~1#1|))) (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; {294#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc11#1.base|) (* (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset|) (* (- 1) |ULTIMATE.start_main_~i~1#1|))) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~i~1#1| 1) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)) (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 04:34:53,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc11#1.base|) (* (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset|) (* (- 1) |ULTIMATE.start_main_~i~1#1|))) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~i~1#1| 1) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)) (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {267#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc11#1.base|) (* (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset|) (* (- 1) |ULTIMATE.start_main_~i~1#1|)))) unseeded) (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 04:34:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:53,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:53,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:53,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:53,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,815 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 04:34:53,815 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:53,885 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 36 transitions. Complement of second has 7 states. [2022-02-21 04:34:53,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:34:53,885 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:53,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. cyclomatic complexity: 11 [2022-02-21 04:34:53,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:53,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:53,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:53,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:34:53,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:53,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:53,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 36 transitions. [2022-02-21 04:34:53,890 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:34:53,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:53,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:53,892 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 24 transitions. cyclomatic complexity: 11 [2022-02-21 04:34:53,895 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 04:34:53,895 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:53,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:34:53,912 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:34:53,912 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 36 transitions. cyclomatic complexity: 18 [2022-02-21 04:34:53,913 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 04:34:53,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:53,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:53,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:53,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:53,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:53,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:53,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:34:53,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:34:53,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:34:53,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 24 letters. [2022-02-21 04:34:53,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 24 letters. [2022-02-21 04:34:53,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 24 letters. Loop has 24 letters. [2022-02-21 04:34:53,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 17 letters. [2022-02-21 04:34:53,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 17 letters. [2022-02-21 04:34:53,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 17 letters. [2022-02-21 04:34:53,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:34:53,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:34:53,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:34:53,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:34:53,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:34:53,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:34:53,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:34:53,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:34:53,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:34:53,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:34:53,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:34:53,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:34:53,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:34:53,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:34:53,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:34:53,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:53,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:53,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:53,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:34:53,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:34:53,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:34:53,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:53,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:53,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:53,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:34:53,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:34:53,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:34:53,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:34:53,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:34:53,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:34:53,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:34:53,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:34:53,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:34:53,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:34:53,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:34:53,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:34:53,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,945 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:53,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:53,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-02-21 04:34:53,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:53,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:34:53,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:34:53,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 36 transitions. cyclomatic complexity: 18 [2022-02-21 04:34:53,948 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:34:53,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 26 transitions. [2022-02-21 04:34:53,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 04:34:53,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 04:34:53,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2022-02-21 04:34:53,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:53,948 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-02-21 04:34:53,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2022-02-21 04:34:53,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-21 04:34:53,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:53,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:53,949 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:53,949 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:53,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:53,950 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2022-02-21 04:34:53,950 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2022-02-21 04:34:53,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:53,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:53,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 26 transitions. [2022-02-21 04:34:53,950 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 26 transitions. [2022-02-21 04:34:53,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:53,951 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2022-02-21 04:34:53,951 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2022-02-21 04:34:53,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:53,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:53,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:53,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:53,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2022-02-21 04:34:53,954 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-02-21 04:34:53,954 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-02-21 04:34:53,954 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:34:53,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2022-02-21 04:34:53,954 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:34:53,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:53,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:53,955 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:34:53,955 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:53,955 INFO L791 eck$LassoCheckResult]: Stem: 338#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 339#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 344#L527 assume !(main_~length1~0#1 < 1); 350#L527-2 assume !(main_~length2~0#1 < 2); 351#L530-1 assume !(main_~length3~0#1 < 1); 349#L533-1 assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 345#L540-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 347#L540-4 main_~i~1#1 := 0; 334#L545-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 335#L545-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length3~0#1 - 1), 1);assume { :begin_inline_cstrcat } true;cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset, cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc cstrcat_#res#1.base, cstrcat_#res#1.offset;havoc cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset, cstrcat_#t~mem2#1, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, cstrcat_#t~mem6#1, cstrcat_~s1#1.base, cstrcat_~s1#1.offset, cstrcat_~s2#1.base, cstrcat_~s2#1.offset, cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s1#1.base, cstrcat_~s1#1.offset := cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset;cstrcat_~s2#1.base, cstrcat_~s2#1.offset := cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_~s1#1.base, cstrcat_~s1#1.offset; 343#L517-3 [2022-02-21 04:34:53,955 INFO L793 eck$LassoCheckResult]: Loop: 343#L517-3 call cstrcat_#t~mem2#1 := read~int(cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset, 1); 342#L517-1 assume !!(0 != cstrcat_#t~mem2#1);havoc cstrcat_#t~mem2#1;cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset := cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_#t~post3#1.base, 1 + cstrcat_#t~post3#1.offset;havoc cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset; 343#L517-3 [2022-02-21 04:34:53,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:53,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1713495071, now seen corresponding path program 1 times [2022-02-21 04:34:53,956 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:53,956 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147808002] [2022-02-21 04:34:53,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:53,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:54,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {391#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {391#true} is VALID [2022-02-21 04:34:54,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {391#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {391#true} is VALID [2022-02-21 04:34:54,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {391#true} assume !(main_~length1~0#1 < 1); {391#true} is VALID [2022-02-21 04:34:54,012 INFO L290 TraceCheckUtils]: 3: Hoare triple {391#true} assume !(main_~length2~0#1 < 2); {393#(<= 2 |ULTIMATE.start_main_~length2~0#1|)} is VALID [2022-02-21 04:34:54,012 INFO L290 TraceCheckUtils]: 4: Hoare triple {393#(<= 2 |ULTIMATE.start_main_~length2~0#1|)} assume !(main_~length3~0#1 < 1); {393#(<= 2 |ULTIMATE.start_main_~length2~0#1|)} is VALID [2022-02-21 04:34:54,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#(<= 2 |ULTIMATE.start_main_~length2~0#1|)} assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; {393#(<= 2 |ULTIMATE.start_main_~length2~0#1|)} is VALID [2022-02-21 04:34:54,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {393#(<= 2 |ULTIMATE.start_main_~length2~0#1|)} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {393#(<= 2 |ULTIMATE.start_main_~length2~0#1|)} is VALID [2022-02-21 04:34:54,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {393#(<= 2 |ULTIMATE.start_main_~length2~0#1|)} main_~i~1#1 := 0; {394#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 2 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:34:54,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {394#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 2 |ULTIMATE.start_main_~length2~0#1|))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {392#false} is VALID [2022-02-21 04:34:54,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {392#false} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length3~0#1 - 1), 1);assume { :begin_inline_cstrcat } true;cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset, cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc cstrcat_#res#1.base, cstrcat_#res#1.offset;havoc cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset, cstrcat_#t~mem2#1, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, cstrcat_#t~mem6#1, cstrcat_~s1#1.base, cstrcat_~s1#1.offset, cstrcat_~s2#1.base, cstrcat_~s2#1.offset, cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s1#1.base, cstrcat_~s1#1.offset := cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset;cstrcat_~s2#1.base, cstrcat_~s2#1.offset := cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_~s1#1.base, cstrcat_~s1#1.offset; {392#false} is VALID [2022-02-21 04:34:54,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:54,015 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:34:54,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147808002] [2022-02-21 04:34:54,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147808002] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:34:54,016 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:34:54,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:34:54,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091806991] [2022-02-21 04:34:54,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:34:54,019 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:34:54,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:54,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 1 times [2022-02-21 04:34:54,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:54,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386894550] [2022-02-21 04:34:54,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:54,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:54,024 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:54,036 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:54,067 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:34:54,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:34:54,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:34:54,071 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:54,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:54,117 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2022-02-21 04:34:54,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 04:34:54,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:54,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:54,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2022-02-21 04:34:54,128 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:34:54,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2022-02-21 04:34:54,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 04:34:54,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 04:34:54,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2022-02-21 04:34:54,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:54,129 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 04:34:54,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2022-02-21 04:34:54,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-02-21 04:34:54,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:54,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:54,131 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:54,131 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:54,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:54,132 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2022-02-21 04:34:54,132 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2022-02-21 04:34:54,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:54,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:54,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 26 transitions. [2022-02-21 04:34:54,132 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 26 transitions. [2022-02-21 04:34:54,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:54,133 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2022-02-21 04:34:54,133 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2022-02-21 04:34:54,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:54,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:54,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:54,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:54,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2022-02-21 04:34:54,135 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 04:34:54,135 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 04:34:54,135 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:34:54,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2022-02-21 04:34:54,136 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:34:54,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:54,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:54,136 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:34:54,136 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:54,136 INFO L791 eck$LassoCheckResult]: Stem: 420#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 421#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 424#L527 assume !(main_~length1~0#1 < 1); 432#L527-2 assume !(main_~length2~0#1 < 2); 433#L530-1 assume !(main_~length3~0#1 < 1); 431#L533-1 assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 425#L540-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 427#L540-4 main_~i~1#1 := 0; 416#L545-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 417#L545-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 418#L545-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 419#L545-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length3~0#1 - 1), 1);assume { :begin_inline_cstrcat } true;cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset, cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc cstrcat_#res#1.base, cstrcat_#res#1.offset;havoc cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset, cstrcat_#t~mem2#1, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, cstrcat_#t~mem6#1, cstrcat_~s1#1.base, cstrcat_~s1#1.offset, cstrcat_~s2#1.base, cstrcat_~s2#1.offset, cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s1#1.base, cstrcat_~s1#1.offset := cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset;cstrcat_~s2#1.base, cstrcat_~s2#1.offset := cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_~s1#1.base, cstrcat_~s1#1.offset; 430#L517-3 [2022-02-21 04:34:54,136 INFO L793 eck$LassoCheckResult]: Loop: 430#L517-3 call cstrcat_#t~mem2#1 := read~int(cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset, 1); 429#L517-1 assume !!(0 != cstrcat_#t~mem2#1);havoc cstrcat_#t~mem2#1;cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset := cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_#t~post3#1.base, 1 + cstrcat_#t~post3#1.offset;havoc cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset; 430#L517-3 [2022-02-21 04:34:54,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:54,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1696346049, now seen corresponding path program 1 times [2022-02-21 04:34:54,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:54,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625469732] [2022-02-21 04:34:54,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:54,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:54,155 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:54,168 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:54,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:54,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 2 times [2022-02-21 04:34:54,169 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:54,169 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75810574] [2022-02-21 04:34:54,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:54,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:54,173 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:54,176 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:54,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:54,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1899017530, now seen corresponding path program 1 times [2022-02-21 04:34:54,177 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:54,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126084898] [2022-02-21 04:34:54,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:54,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:54,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {479#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {479#true} is VALID [2022-02-21 04:34:54,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {479#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {479#true} is VALID [2022-02-21 04:34:54,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {479#true} assume !(main_~length1~0#1 < 1); {481#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:34:54,384 INFO L290 TraceCheckUtils]: 3: Hoare triple {481#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} assume !(main_~length2~0#1 < 2); {481#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:34:54,385 INFO L290 TraceCheckUtils]: 4: Hoare triple {481#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} assume !(main_~length3~0#1 < 1); {482#(and (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} is VALID [2022-02-21 04:34:54,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {482#(and (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; {483#(and (or (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 0) (and (<= (+ |ULTIMATE.start_main_~length3~0#1| 1) |ULTIMATE.start_main_~length2~0#1|) (<= 1 |ULTIMATE.start_main_~length3~0#1|))) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0))} is VALID [2022-02-21 04:34:54,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {483#(and (or (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 0) (and (<= (+ |ULTIMATE.start_main_~length3~0#1| 1) |ULTIMATE.start_main_~length2~0#1|) (<= 1 |ULTIMATE.start_main_~length3~0#1|))) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {483#(and (or (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 0) (and (<= (+ |ULTIMATE.start_main_~length3~0#1| 1) |ULTIMATE.start_main_~length2~0#1|) (<= 1 |ULTIMATE.start_main_~length3~0#1|))) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0))} is VALID [2022-02-21 04:34:54,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {483#(and (or (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 0) (and (<= (+ |ULTIMATE.start_main_~length3~0#1| 1) |ULTIMATE.start_main_~length2~0#1|) (<= 1 |ULTIMATE.start_main_~length3~0#1|))) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0))} main_~i~1#1 := 0; {484#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~1#1| 0) (<= (+ |ULTIMATE.start_main_~length3~0#1| 1) |ULTIMATE.start_main_~length2~0#1|) (<= 1 |ULTIMATE.start_main_~length3~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 0)))} is VALID [2022-02-21 04:34:54,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {484#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~1#1| 0) (<= (+ |ULTIMATE.start_main_~length3~0#1| 1) |ULTIMATE.start_main_~length2~0#1|) (<= 1 |ULTIMATE.start_main_~length3~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 0)))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; {484#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~1#1| 0) (<= (+ |ULTIMATE.start_main_~length3~0#1| 1) |ULTIMATE.start_main_~length2~0#1|) (<= 1 |ULTIMATE.start_main_~length3~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 0)))} is VALID [2022-02-21 04:34:54,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {484#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~1#1| 0) (<= (+ |ULTIMATE.start_main_~length3~0#1| 1) |ULTIMATE.start_main_~length2~0#1|) (<= 1 |ULTIMATE.start_main_~length3~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 0)))} main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {485#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 1) (<= (+ |ULTIMATE.start_main_~length3~0#1| |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~length2~0#1|)) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} is VALID [2022-02-21 04:34:54,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {485#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 1) (<= (+ |ULTIMATE.start_main_~length3~0#1| |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~length2~0#1|)) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {486#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 1))} is VALID [2022-02-21 04:34:54,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {486#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 1))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length3~0#1 - 1), 1);assume { :begin_inline_cstrcat } true;cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset, cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc cstrcat_#res#1.base, cstrcat_#res#1.offset;havoc cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset, cstrcat_#t~mem2#1, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, cstrcat_#t~mem6#1, cstrcat_~s1#1.base, cstrcat_~s1#1.offset, cstrcat_~s2#1.base, cstrcat_~s2#1.offset, cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s1#1.base, cstrcat_~s1#1.offset := cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset;cstrcat_~s2#1.base, cstrcat_~s2#1.offset := cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_~s1#1.base, cstrcat_~s1#1.offset; {487#(= (select (select |#memory_int| |ULTIMATE.start_cstrcat_~s~0#1.base|) |ULTIMATE.start_cstrcat_~s~0#1.offset|) 0)} is VALID [2022-02-21 04:34:54,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {487#(= (select (select |#memory_int| |ULTIMATE.start_cstrcat_~s~0#1.base|) |ULTIMATE.start_cstrcat_~s~0#1.offset|) 0)} call cstrcat_#t~mem2#1 := read~int(cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset, 1); {488#(= 0 |ULTIMATE.start_cstrcat_#t~mem2#1|)} is VALID [2022-02-21 04:34:54,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {488#(= 0 |ULTIMATE.start_cstrcat_#t~mem2#1|)} assume !!(0 != cstrcat_#t~mem2#1);havoc cstrcat_#t~mem2#1;cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset := cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_#t~post3#1.base, 1 + cstrcat_#t~post3#1.offset;havoc cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset; {480#false} is VALID [2022-02-21 04:34:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:54,391 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:34:54,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126084898] [2022-02-21 04:34:54,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126084898] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:34:54,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670891809] [2022-02-21 04:34:54,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:54,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:34:54,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,408 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:34:54,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-02-21 04:34:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:54,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-21 04:34:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:54,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:54,944 INFO L356 Elim1Store]: treesize reduction 32, result has 37.3 percent of original size [2022-02-21 04:34:54,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 80 [2022-02-21 04:34:54,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2022-02-21 04:34:55,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2022-02-21 04:34:55,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2022-02-21 04:34:55,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 3 [2022-02-21 04:34:55,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 04:34:55,683 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 04:34:55,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 10 [2022-02-21 04:34:55,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {479#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {479#true} is VALID [2022-02-21 04:34:55,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {479#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {479#true} is VALID [2022-02-21 04:34:55,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {479#true} assume !(main_~length1~0#1 < 1); {481#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:34:55,717 INFO L290 TraceCheckUtils]: 3: Hoare triple {481#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} assume !(main_~length2~0#1 < 2); {481#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:34:55,718 INFO L290 TraceCheckUtils]: 4: Hoare triple {481#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} assume !(main_~length3~0#1 < 1); {482#(and (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} is VALID [2022-02-21 04:34:55,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {482#(and (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; {507#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~length3~0#1| 1) |ULTIMATE.start_main_~length2~0#1|) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} is VALID [2022-02-21 04:34:55,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {507#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~length3~0#1| 1) |ULTIMATE.start_main_~length2~0#1|) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {507#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~length3~0#1| 1) |ULTIMATE.start_main_~length2~0#1|) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} is VALID [2022-02-21 04:34:55,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~length3~0#1| 1) |ULTIMATE.start_main_~length2~0#1|) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} main_~i~1#1 := 0; {514#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~1#1| 0) (<= (+ |ULTIMATE.start_main_~length3~0#1| 1) |ULTIMATE.start_main_~length2~0#1|) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} is VALID [2022-02-21 04:34:55,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {514#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~1#1| 0) (<= (+ |ULTIMATE.start_main_~length3~0#1| 1) |ULTIMATE.start_main_~length2~0#1|) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; {514#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~1#1| 0) (<= (+ |ULTIMATE.start_main_~length3~0#1| 1) |ULTIMATE.start_main_~length2~0#1|) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} is VALID [2022-02-21 04:34:55,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {514#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~1#1| 0) (<= (+ |ULTIMATE.start_main_~length3~0#1| 1) |ULTIMATE.start_main_~length2~0#1|) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {521#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~1#1| 1) (<= (+ |ULTIMATE.start_main_~length3~0#1| 1) |ULTIMATE.start_main_~length2~0#1|) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} is VALID [2022-02-21 04:34:55,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {521#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~1#1| 1) (<= (+ |ULTIMATE.start_main_~length3~0#1| 1) |ULTIMATE.start_main_~length2~0#1|) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {525#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~length3~0#1| 1) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} is VALID [2022-02-21 04:34:55,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {525#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~length3~0#1| 1) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length3~0#1 - 1), 1);assume { :begin_inline_cstrcat } true;cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset, cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc cstrcat_#res#1.base, cstrcat_#res#1.offset;havoc cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset, cstrcat_#t~mem2#1, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, cstrcat_#t~mem6#1, cstrcat_~s1#1.base, cstrcat_~s1#1.offset, cstrcat_~s2#1.base, cstrcat_~s2#1.offset, cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s1#1.base, cstrcat_~s1#1.offset := cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset;cstrcat_~s2#1.base, cstrcat_~s2#1.offset := cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_~s1#1.base, cstrcat_~s1#1.offset; {529#(exists ((|ULTIMATE.start_main_~nondetString2~0#1.offset| Int) (|ULTIMATE.start_main_~length3~0#1| Int)) (and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~length3~0#1| 1) (<= |ULTIMATE.start_cstrcat_~s~0#1.offset| |ULTIMATE.start_main_~nondetString2~0#1.offset|) (<= 1 |ULTIMATE.start_main_~length3~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_cstrcat_~s~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|)) 0)))} is VALID [2022-02-21 04:34:55,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {529#(exists ((|ULTIMATE.start_main_~nondetString2~0#1.offset| Int) (|ULTIMATE.start_main_~length3~0#1| Int)) (and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~length3~0#1| 1) (<= |ULTIMATE.start_cstrcat_~s~0#1.offset| |ULTIMATE.start_main_~nondetString2~0#1.offset|) (<= 1 |ULTIMATE.start_main_~length3~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_cstrcat_~s~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|)) 0)))} call cstrcat_#t~mem2#1 := read~int(cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset, 1); {488#(= 0 |ULTIMATE.start_cstrcat_#t~mem2#1|)} is VALID [2022-02-21 04:34:55,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {488#(= 0 |ULTIMATE.start_cstrcat_#t~mem2#1|)} assume !!(0 != cstrcat_#t~mem2#1);havoc cstrcat_#t~mem2#1;cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset := cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_#t~post3#1.base, 1 + cstrcat_#t~post3#1.offset;havoc cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset; {480#false} is VALID [2022-02-21 04:34:55,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:55,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:34:55,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-02-21 04:34:55,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2022-02-21 04:34:55,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-02-21 04:34:56,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {488#(= 0 |ULTIMATE.start_cstrcat_#t~mem2#1|)} assume !!(0 != cstrcat_#t~mem2#1);havoc cstrcat_#t~mem2#1;cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset := cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_#t~post3#1.base, 1 + cstrcat_#t~post3#1.offset;havoc cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset; {480#false} is VALID [2022-02-21 04:34:56,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {539#(or (not (<= 0 |ULTIMATE.start_cstrcat_~s~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcat_~s~0#1.base|) |ULTIMATE.start_cstrcat_~s~0#1.offset|) 0))} call cstrcat_#t~mem2#1 := read~int(cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset, 1); {488#(= 0 |ULTIMATE.start_cstrcat_#t~mem2#1|)} is VALID [2022-02-21 04:34:56,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {543#(and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length3~0#1|)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 1)))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length3~0#1 - 1), 1);assume { :begin_inline_cstrcat } true;cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset, cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc cstrcat_#res#1.base, cstrcat_#res#1.offset;havoc cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset, cstrcat_#t~mem2#1, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, cstrcat_#t~mem6#1, cstrcat_~s1#1.base, cstrcat_~s1#1.offset, cstrcat_~s2#1.base, cstrcat_~s2#1.offset, cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s1#1.base, cstrcat_~s1#1.offset := cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset;cstrcat_~s2#1.base, cstrcat_~s2#1.offset := cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_~s1#1.base, cstrcat_~s1#1.offset; {539#(or (not (<= 0 |ULTIMATE.start_cstrcat_~s~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcat_~s~0#1.base|) |ULTIMATE.start_cstrcat_~s~0#1.offset|) 0))} is VALID [2022-02-21 04:34:56,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {547#(or (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length2~0#1|) (and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length3~0#1|)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 1))))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {543#(and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length3~0#1|)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 1)))} is VALID [2022-02-21 04:34:56,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {551#(or (< (+ 2 |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~length2~0#1|) (and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length3~0#1|)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 1))))} main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {547#(or (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length2~0#1|) (and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length3~0#1|)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 1))))} is VALID [2022-02-21 04:34:56,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {551#(or (< (+ 2 |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~length2~0#1|) (and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length3~0#1|)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 1))))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; {551#(or (< (+ 2 |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~length2~0#1|) (and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length3~0#1|)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 1))))} is VALID [2022-02-21 04:34:56,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {558#(or (and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length3~0#1|)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 1))) (< 2 |ULTIMATE.start_main_~length2~0#1|))} main_~i~1#1 := 0; {551#(or (< (+ 2 |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~length2~0#1|) (and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length3~0#1|)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 1))))} is VALID [2022-02-21 04:34:56,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {558#(or (and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length3~0#1|)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 1))) (< 2 |ULTIMATE.start_main_~length2~0#1|))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {558#(or (and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length3~0#1|)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 1))) (< 2 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:34:56,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {565#(or (< 2 (+ |ULTIMATE.start_main_~length1~0#1| |ULTIMATE.start_main_~length3~0#1|)) (and (<= |ULTIMATE.start_main_~length3~0#1| 1) (<= 1 |ULTIMATE.start_main_~length3~0#1|)))} assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; {558#(or (and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length3~0#1|)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 1))) (< 2 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:34:56,328 INFO L290 TraceCheckUtils]: 4: Hoare triple {481#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} assume !(main_~length3~0#1 < 1); {565#(or (< 2 (+ |ULTIMATE.start_main_~length1~0#1| |ULTIMATE.start_main_~length3~0#1|)) (and (<= |ULTIMATE.start_main_~length3~0#1| 1) (<= 1 |ULTIMATE.start_main_~length3~0#1|)))} is VALID [2022-02-21 04:34:56,329 INFO L290 TraceCheckUtils]: 3: Hoare triple {481#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} assume !(main_~length2~0#1 < 2); {481#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:34:56,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {479#true} assume !(main_~length1~0#1 < 1); {481#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:34:56,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {479#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {479#true} is VALID [2022-02-21 04:34:56,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {479#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {479#true} is VALID [2022-02-21 04:34:56,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:56,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670891809] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:34:56,330 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:34:56,330 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-02-21 04:34:56,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142100422] [2022-02-21 04:34:56,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:34:56,360 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:34:56,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-21 04:34:56,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2022-02-21 04:34:56,361 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. cyclomatic complexity: 11 Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:56,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:56,945 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-02-21 04:34:56,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 04:34:56,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:56,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:56,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2022-02-21 04:34:56,990 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:34:56,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 33 transitions. [2022-02-21 04:34:56,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-02-21 04:34:56,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-02-21 04:34:56,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2022-02-21 04:34:56,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:56,991 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-21 04:34:56,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2022-02-21 04:34:56,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-02-21 04:34:56,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:56,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 33 transitions. Second operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:56,992 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 33 transitions. Second operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:56,992 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:56,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:56,996 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-02-21 04:34:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-21 04:34:56,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:56,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:56,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 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 25 states and 33 transitions. [2022-02-21 04:34:56,996 INFO L87 Difference]: Start difference. First operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 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 25 states and 33 transitions. [2022-02-21 04:34:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:56,997 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-02-21 04:34:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-21 04:34:56,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:56,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:56,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:56,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:56,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:56,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-02-21 04:34:56,999 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-02-21 04:34:56,999 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-02-21 04:34:56,999 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:34:56,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2022-02-21 04:34:56,999 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:34:56,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:56,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:57,000 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:34:57,000 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:57,000 INFO L791 eck$LassoCheckResult]: Stem: 620#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 621#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 624#L527 assume !(main_~length1~0#1 < 1); 631#L527-2 assume !(main_~length2~0#1 < 2); 632#L530-1 assume !(main_~length3~0#1 < 1); 630#L533-1 assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 625#L540-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 627#L540-4 main_~i~1#1 := 0; 615#L545-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 616#L545-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 617#L545-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 618#L545-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length3~0#1 - 1), 1);assume { :begin_inline_cstrcat } true;cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset, cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc cstrcat_#res#1.base, cstrcat_#res#1.offset;havoc cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset, cstrcat_#t~mem2#1, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, cstrcat_#t~mem6#1, cstrcat_~s1#1.base, cstrcat_~s1#1.offset, cstrcat_~s2#1.base, cstrcat_~s2#1.offset, cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s1#1.base, cstrcat_~s1#1.offset := cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset;cstrcat_~s2#1.base, cstrcat_~s2#1.offset := cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_~s1#1.base, cstrcat_~s1#1.offset; 636#L517-3 call cstrcat_#t~mem2#1 := read~int(cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset, 1); 629#L517-1 assume !(0 != cstrcat_#t~mem2#1);havoc cstrcat_#t~mem2#1; 622#L519-2 [2022-02-21 04:34:57,000 INFO L793 eck$LassoCheckResult]: Loop: 622#L519-2 cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset := cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_#t~post4#1.base, 1 + cstrcat_#t~post4#1.offset;cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset := cstrcat_~s2#1.base, cstrcat_~s2#1.offset;cstrcat_~s2#1.base, cstrcat_~s2#1.offset := cstrcat_#t~post5#1.base, 1 + cstrcat_#t~post5#1.offset;call cstrcat_#t~mem6#1 := read~int(cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, 1);call write~int(cstrcat_#t~mem6#1, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, 1); 623#L519 assume !!(0 != cstrcat_#t~mem6#1);havoc cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset;havoc cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset;havoc cstrcat_#t~mem6#1; 622#L519-2 [2022-02-21 04:34:57,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:57,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1899017532, now seen corresponding path program 1 times [2022-02-21 04:34:57,001 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:57,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981550041] [2022-02-21 04:34:57,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:57,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:57,019 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:57,029 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:57,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:57,030 INFO L85 PathProgramCache]: Analyzing trace with hash 3206, now seen corresponding path program 1 times [2022-02-21 04:34:57,030 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:57,030 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241490905] [2022-02-21 04:34:57,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:57,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:57,034 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:57,038 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:57,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:57,038 INFO L85 PathProgramCache]: Analyzing trace with hash 405254793, now seen corresponding path program 1 times [2022-02-21 04:34:57,038 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:57,038 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737694990] [2022-02-21 04:34:57,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:57,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:57,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {695#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {695#true} is VALID [2022-02-21 04:34:57,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {695#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {695#true} is VALID [2022-02-21 04:34:57,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {695#true} assume !(main_~length1~0#1 < 1); {697#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:34:57,151 INFO L290 TraceCheckUtils]: 3: Hoare triple {697#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} assume !(main_~length2~0#1 < 2); {697#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:34:57,152 INFO L290 TraceCheckUtils]: 4: Hoare triple {697#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} assume !(main_~length3~0#1 < 1); {697#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:34:57,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {697#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; {698#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (or (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (not (= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))))} is VALID [2022-02-21 04:34:57,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {698#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (or (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (not (= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {699#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} is VALID [2022-02-21 04:34:57,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {699#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} main_~i~1#1 := 0; {699#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} is VALID [2022-02-21 04:34:57,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {699#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; {699#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} is VALID [2022-02-21 04:34:57,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {699#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {699#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} is VALID [2022-02-21 04:34:57,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {699#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {699#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} is VALID [2022-02-21 04:34:57,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {699#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length3~0#1 - 1), 1);assume { :begin_inline_cstrcat } true;cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset, cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc cstrcat_#res#1.base, cstrcat_#res#1.offset;havoc cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset, cstrcat_#t~mem2#1, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, cstrcat_#t~mem6#1, cstrcat_~s1#1.base, cstrcat_~s1#1.offset, cstrcat_~s2#1.base, cstrcat_~s2#1.offset, cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s1#1.base, cstrcat_~s1#1.offset := cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset;cstrcat_~s2#1.base, cstrcat_~s2#1.offset := cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_~s1#1.base, cstrcat_~s1#1.offset; {700#(= (select (select |#memory_int| |ULTIMATE.start_cstrcat_~s2#1.base|) |ULTIMATE.start_cstrcat_~s2#1.offset|) 0)} is VALID [2022-02-21 04:34:57,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {700#(= (select (select |#memory_int| |ULTIMATE.start_cstrcat_~s2#1.base|) |ULTIMATE.start_cstrcat_~s2#1.offset|) 0)} call cstrcat_#t~mem2#1 := read~int(cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset, 1); {700#(= (select (select |#memory_int| |ULTIMATE.start_cstrcat_~s2#1.base|) |ULTIMATE.start_cstrcat_~s2#1.offset|) 0)} is VALID [2022-02-21 04:34:57,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {700#(= (select (select |#memory_int| |ULTIMATE.start_cstrcat_~s2#1.base|) |ULTIMATE.start_cstrcat_~s2#1.offset|) 0)} assume !(0 != cstrcat_#t~mem2#1);havoc cstrcat_#t~mem2#1; {700#(= (select (select |#memory_int| |ULTIMATE.start_cstrcat_~s2#1.base|) |ULTIMATE.start_cstrcat_~s2#1.offset|) 0)} is VALID [2022-02-21 04:34:57,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {700#(= (select (select |#memory_int| |ULTIMATE.start_cstrcat_~s2#1.base|) |ULTIMATE.start_cstrcat_~s2#1.offset|) 0)} cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset := cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_#t~post4#1.base, 1 + cstrcat_#t~post4#1.offset;cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset := cstrcat_~s2#1.base, cstrcat_~s2#1.offset;cstrcat_~s2#1.base, cstrcat_~s2#1.offset := cstrcat_#t~post5#1.base, 1 + cstrcat_#t~post5#1.offset;call cstrcat_#t~mem6#1 := read~int(cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, 1);call write~int(cstrcat_#t~mem6#1, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, 1); {701#(= 0 |ULTIMATE.start_cstrcat_#t~mem6#1|)} is VALID [2022-02-21 04:34:57,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {701#(= 0 |ULTIMATE.start_cstrcat_#t~mem6#1|)} assume !!(0 != cstrcat_#t~mem6#1);havoc cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset;havoc cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset;havoc cstrcat_#t~mem6#1; {696#false} is VALID [2022-02-21 04:34:57,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:34:57,162 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:34:57,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737694990] [2022-02-21 04:34:57,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737694990] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:34:57,163 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:34:57,163 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 04:34:57,163 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184830413] [2022-02-21 04:34:57,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:34:57,261 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:34:57,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 04:34:57,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-21 04:34:57,262 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:57,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:57,496 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-02-21 04:34:57,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 04:34:57,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:57,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:57,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2022-02-21 04:34:57,516 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-02-21 04:34:57,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 33 states and 42 transitions. [2022-02-21 04:34:57,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-02-21 04:34:57,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2022-02-21 04:34:57,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2022-02-21 04:34:57,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:57,517 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-02-21 04:34:57,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2022-02-21 04:34:57,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-02-21 04:34:57,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:57,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 42 transitions. Second operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:57,519 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 42 transitions. Second operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:57,519 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:57,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:57,520 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-02-21 04:34:57,520 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-02-21 04:34:57,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:57,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:57,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 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 33 states and 42 transitions. [2022-02-21 04:34:57,520 INFO L87 Difference]: Start difference. First operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 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 33 states and 42 transitions. [2022-02-21 04:34:57,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:57,521 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-02-21 04:34:57,522 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-02-21 04:34:57,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:57,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:57,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:57,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:57,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-02-21 04:34:57,523 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-02-21 04:34:57,523 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-02-21 04:34:57,523 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:34:57,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2022-02-21 04:34:57,524 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-02-21 04:34:57,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:57,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:57,524 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:34:57,525 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:57,525 INFO L791 eck$LassoCheckResult]: Stem: 751#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 752#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 762#L527 assume !(main_~length1~0#1 < 1); 764#L527-2 assume !(main_~length2~0#1 < 2); 765#L530-1 assume !(main_~length3~0#1 < 1); 763#L533-1 assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 755#L540-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 757#L540-4 main_~i~1#1 := 0; 766#L545-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 774#L545-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 773#L545-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 772#L545-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 771#L545-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 770#L545-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length3~0#1 - 1), 1);assume { :begin_inline_cstrcat } true;cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset, cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc cstrcat_#res#1.base, cstrcat_#res#1.offset;havoc cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset, cstrcat_#t~mem2#1, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, cstrcat_#t~mem6#1, cstrcat_~s1#1.base, cstrcat_~s1#1.offset, cstrcat_~s2#1.base, cstrcat_~s2#1.offset, cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s1#1.base, cstrcat_~s1#1.offset := cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset;cstrcat_~s2#1.base, cstrcat_~s2#1.offset := cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_~s1#1.base, cstrcat_~s1#1.offset; 761#L517-3 [2022-02-21 04:34:57,525 INFO L793 eck$LassoCheckResult]: Loop: 761#L517-3 call cstrcat_#t~mem2#1 := read~int(cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset, 1); 760#L517-1 assume !!(0 != cstrcat_#t~mem2#1);havoc cstrcat_#t~mem2#1;cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset := cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_#t~post3#1.base, 1 + cstrcat_#t~post3#1.offset;havoc cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset; 761#L517-3 [2022-02-21 04:34:57,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:57,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1898962205, now seen corresponding path program 2 times [2022-02-21 04:34:57,526 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:57,526 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307681838] [2022-02-21 04:34:57,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:57,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:57,547 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:57,560 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:57,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:57,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 3 times [2022-02-21 04:34:57,561 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:57,561 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510621102] [2022-02-21 04:34:57,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:57,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:57,565 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:57,568 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:57,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:57,569 INFO L85 PathProgramCache]: Analyzing trace with hash 458423656, now seen corresponding path program 2 times [2022-02-21 04:34:57,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:57,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738783418] [2022-02-21 04:34:57,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:57,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:57,590 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:57,606 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:58,496 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:34:58,496 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:34:58,496 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:34:58,496 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:34:58,496 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:34:58,496 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:58,497 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:34:58,497 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:34:58,497 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration6_Lasso [2022-02-21 04:34:58,497 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:34:58,497 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:34:58,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:58,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:58,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:58,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:58,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:58,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:58,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:58,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:58,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:58,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:58,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:58,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:58,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:58,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:58,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:58,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:58,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:58,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:58,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:58,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:58,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:58,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:59,065 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 04:34:59,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:59,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:59,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:59,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:59,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:59,709 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:34:59,710 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:34:59,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:59,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:59,711 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:59,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 04:34:59,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:59,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:59,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:59,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:59,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:59,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:59,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:59,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:59,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:59,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:59,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:59,795 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:59,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 04:34:59,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:59,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:59,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:59,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:59,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:59,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:59,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:59,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:59,821 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:59,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:59,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:59,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:59,846 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:59,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 04:34:59,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:59,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:59,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:59,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:59,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:59,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:59,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:59,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:59,861 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:59,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 04:34:59,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:59,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:59,898 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:59,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 04:34:59,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:59,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:59,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:59,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:59,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:59,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:59,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:59,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:59,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:59,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:59,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:59,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:59,940 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:59,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 04:34:59,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:59,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:59,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:59,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:59,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:59,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:59,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:59,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:59,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:59,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:59,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:59,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:59,980 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:59,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 04:34:59,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:59,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:59,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:59,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:59,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:59,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,000 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:00,000 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:00,002 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:00,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,027 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 04:35:00,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:00,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:00,042 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:00,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,066 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 04:35:00,073 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:00,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:00,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:00,090 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:00,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,114 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 04:35:00,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:00,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:00,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:00,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-02-21 04:35:00,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,162 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 04:35:00,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:00,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:00,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:00,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:00,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,198 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 04:35:00,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:00,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:00,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:00,223 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:00,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,241 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 04:35:00,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:00,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:00,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-02-21 04:35:00,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,294 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 04:35:00,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:00,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:00,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:00,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-02-21 04:35:00,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,343 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 04:35:00,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:00,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:00,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:00,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:00,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,395 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 04:35:00,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:00,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:00,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:00,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:00,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,431 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 04:35:00,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:00,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:00,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:00,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-02-21 04:35:00,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,499 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 04:35:00,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,510 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:00,510 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:00,524 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-02-21 04:35:00,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,546 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 04:35:00,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:00,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:00,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:00,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-02-21 04:35:00,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,579 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-02-21 04:35:00,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:00,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:00,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-02-21 04:35:00,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,614 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-02-21 04:35:00,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:00,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:00,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:00,624 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-02-21 04:35:00,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,641 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-02-21 04:35:00,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:00,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:00,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:00,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:00,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,672 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-02-21 04:35:00,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 04:35:00,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,702 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:00,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:00,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:00,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,744 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-02-21 04:35:00,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:00,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:00,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:00,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,776 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-02-21 04:35:00,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,786 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 04:35:00,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,789 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 04:35:00,789 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:35:00,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-02-21 04:35:00,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,827 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-02-21 04:35:00,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:00,839 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:00,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:00,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,886 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-02-21 04:35:00,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,897 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:00,897 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:00,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:00,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,929 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-02-21 04:35:00,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:00,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:00,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:00,945 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:00,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,978 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-02-21 04:35:00,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:00,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:00,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:01,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:01,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:01,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:01,018 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:01,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-02-21 04:35:01,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:01,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:01,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:01,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:01,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:01,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:01,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:01,045 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:01,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:01,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:01,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:01,070 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:01,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-02-21 04:35:01,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:01,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:01,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:01,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:01,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:01,093 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:01,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:01,111 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:01,144 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2022-02-21 04:35:01,145 INFO L444 ModelExtractionUtils]: 13 out of 55 variables were initially zero. Simplification set additionally 39 variables to zero. [2022-02-21 04:35:01,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:01,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:01,150 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:01,153 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:01,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-02-21 04:35:01,161 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:01,161 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:01,162 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc11#1.base)_3, ULTIMATE.start_cstrcat_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11#1.base)_3 - 1*ULTIMATE.start_cstrcat_~s~0#1.offset Supporting invariants [] [2022-02-21 04:35:01,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:01,264 INFO L297 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2022-02-21 04:35:01,270 INFO L390 LassoCheck]: Loop: "call cstrcat_#t~mem2#1 := read~int(cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset, 1);" "assume !!(0 != cstrcat_#t~mem2#1);havoc cstrcat_#t~mem2#1;cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset := cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_#t~post3#1.base, 1 + cstrcat_#t~post3#1.offset;havoc cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset;" [2022-02-21 04:35:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:01,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:01,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 04:35:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:01,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:01,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {853#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {853#unseeded} is VALID [2022-02-21 04:35:01,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {853#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {853#unseeded} is VALID [2022-02-21 04:35:01,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {853#unseeded} assume !(main_~length1~0#1 < 1); {853#unseeded} is VALID [2022-02-21 04:35:01,385 INFO L290 TraceCheckUtils]: 3: Hoare triple {853#unseeded} assume !(main_~length2~0#1 < 2); {853#unseeded} is VALID [2022-02-21 04:35:01,385 INFO L290 TraceCheckUtils]: 4: Hoare triple {853#unseeded} assume !(main_~length3~0#1 < 1); {853#unseeded} is VALID [2022-02-21 04:35:01,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {853#unseeded} assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; {961#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 04:35:01,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {961#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {961#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 04:35:01,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {961#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} main_~i~1#1 := 0; {961#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 04:35:01,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {961#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; {961#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 04:35:01,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {961#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {961#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 04:35:01,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {961#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; {961#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 04:35:01,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {961#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {961#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 04:35:01,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {961#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {961#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 04:35:01,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {961#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length3~0#1 - 1), 1);assume { :begin_inline_cstrcat } true;cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset, cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc cstrcat_#res#1.base, cstrcat_#res#1.offset;havoc cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset, cstrcat_#t~mem2#1, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, cstrcat_#t~mem6#1, cstrcat_~s1#1.base, cstrcat_~s1#1.offset, cstrcat_~s2#1.base, cstrcat_~s2#1.offset, cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s1#1.base, cstrcat_~s1#1.offset := cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset;cstrcat_~s2#1.base, cstrcat_~s2#1.offset := cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_~s1#1.base, cstrcat_~s1#1.offset; {937#(and (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_cstrcat_~s~0#1.base|) unseeded)} is VALID [2022-02-21 04:35:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:01,406 WARN L261 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:35:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:01,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:01,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:01,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {938#(and (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_cstrcat_~s~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcat_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc11#1.base|))))} call cstrcat_#t~mem2#1 := read~int(cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset, 1); {986#(and (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_cstrcat_~s~0#1.base|) (<= (+ |ULTIMATE.start_cstrcat_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcat_~s~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcat_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc11#1.base|))))} is VALID [2022-02-21 04:35:01,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {986#(and (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_cstrcat_~s~0#1.base|) (<= (+ |ULTIMATE.start_cstrcat_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcat_~s~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcat_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc11#1.base|))))} assume !!(0 != cstrcat_#t~mem2#1);havoc cstrcat_#t~mem2#1;cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset := cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_#t~post3#1.base, 1 + cstrcat_#t~post3#1.offset;havoc cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset; {940#(and (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_cstrcat_~s~0#1.base|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcat_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc11#1.base|))))))} is VALID [2022-02-21 04:35:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:01,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:01,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:01,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Stem has 14 letters. Loop has 2 letters. [2022-02-21 04:35:01,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,452 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 04:35:01,452 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 41 transitions. cyclomatic complexity: 15 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:01,512 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 41 transitions. cyclomatic complexity: 15. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Result 40 states and 52 transitions. Complement of second has 7 states. [2022-02-21 04:35:01,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:01,512 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:01,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. cyclomatic complexity: 15 [2022-02-21 04:35:01,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:01,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:01,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:01,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:01,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:01,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:01,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 52 transitions. [2022-02-21 04:35:01,514 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:01,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:01,514 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 41 transitions. cyclomatic complexity: 15 [2022-02-21 04:35:01,515 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 04:35:01,515 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:01,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:01,518 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:01,518 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 52 transitions. cyclomatic complexity: 18 [2022-02-21 04:35:01,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 52 transitions. cyclomatic complexity: 18 [2022-02-21 04:35:01,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:01,518 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:35:01,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 2 letters. [2022-02-21 04:35:01,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Stem has 14 letters. Loop has 2 letters. [2022-02-21 04:35:01,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 2 letters. [2022-02-21 04:35:01,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:01,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:01,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:01,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 40 letters. Loop has 40 letters. [2022-02-21 04:35:01,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Stem has 40 letters. Loop has 40 letters. [2022-02-21 04:35:01,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 40 letters. Loop has 40 letters. [2022-02-21 04:35:01,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 32 letters. Loop has 32 letters. [2022-02-21 04:35:01,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Stem has 32 letters. Loop has 32 letters. [2022-02-21 04:35:01,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 32 letters. Loop has 32 letters. [2022-02-21 04:35:01,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:01,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:01,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:01,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 2 letters. [2022-02-21 04:35:01,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Stem has 15 letters. Loop has 2 letters. [2022-02-21 04:35:01,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 2 letters. [2022-02-21 04:35:01,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 2 letters. [2022-02-21 04:35:01,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Stem has 14 letters. Loop has 2 letters. [2022-02-21 04:35:01,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 2 letters. [2022-02-21 04:35:01,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 2 letters. [2022-02-21 04:35:01,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Stem has 16 letters. Loop has 2 letters. [2022-02-21 04:35:01,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 2 letters. [2022-02-21 04:35:01,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 2 letters. [2022-02-21 04:35:01,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Stem has 17 letters. Loop has 2 letters. [2022-02-21 04:35:01,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 2 letters. [2022-02-21 04:35:01,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 2 letters. [2022-02-21 04:35:01,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Stem has 17 letters. Loop has 2 letters. [2022-02-21 04:35:01,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 2 letters. [2022-02-21 04:35:01,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 2 letters. [2022-02-21 04:35:01,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Stem has 16 letters. Loop has 2 letters. [2022-02-21 04:35:01,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 2 letters. [2022-02-21 04:35:01,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:01,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:01,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:01,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,526 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:01,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:01,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2022-02-21 04:35:01,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 14 letters. Loop has 2 letters. [2022-02-21 04:35:01,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 16 letters. Loop has 2 letters. [2022-02-21 04:35:01,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:35:01,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 52 transitions. cyclomatic complexity: 18 [2022-02-21 04:35:01,528 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:01,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2022-02-21 04:35:01,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:35:01,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:35:01,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:35:01,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:01,529 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:01,529 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:01,529 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:01,529 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 04:35:01,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:35:01,529 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:01,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:01,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:35:01 BoogieIcfgContainer [2022-02-21 04:35:01,534 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:35:01,534 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:35:01,534 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:35:01,534 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:35:01,535 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:34:49" (3/4) ... [2022-02-21 04:35:01,536 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:35:01,537 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:35:01,537 INFO L158 Benchmark]: Toolchain (without parser) took 12856.51ms. Allocated memory was 109.1MB in the beginning and 192.9MB in the end (delta: 83.9MB). Free memory was 74.6MB in the beginning and 141.8MB in the end (delta: -67.2MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2022-02-21 04:35:01,538 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory was 39.8MB in the beginning and 39.8MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:01,538 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.97ms. Allocated memory is still 109.1MB. Free memory was 74.5MB in the beginning and 75.6MB in the end (delta: -1.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:35:01,538 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.53ms. Allocated memory is still 109.1MB. Free memory was 75.6MB in the beginning and 73.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:01,538 INFO L158 Benchmark]: Boogie Preprocessor took 40.16ms. Allocated memory is still 109.1MB. Free memory was 73.4MB in the beginning and 72.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:01,539 INFO L158 Benchmark]: RCFGBuilder took 413.13ms. Allocated memory is still 109.1MB. Free memory was 72.0MB in the beginning and 57.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 04:35:01,539 INFO L158 Benchmark]: BuchiAutomizer took 11987.57ms. Allocated memory was 109.1MB in the beginning and 192.9MB in the end (delta: 83.9MB). Free memory was 57.7MB in the beginning and 141.8MB in the end (delta: -84.1MB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. [2022-02-21 04:35:01,539 INFO L158 Benchmark]: Witness Printer took 2.53ms. Allocated memory is still 192.9MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:01,540 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory was 39.8MB in the beginning and 39.8MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.97ms. Allocated memory is still 109.1MB. Free memory was 74.5MB in the beginning and 75.6MB in the end (delta: -1.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.53ms. Allocated memory is still 109.1MB. Free memory was 75.6MB in the beginning and 73.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.16ms. Allocated memory is still 109.1MB. Free memory was 73.4MB in the beginning and 72.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 413.13ms. Allocated memory is still 109.1MB. Free memory was 72.0MB in the beginning and 57.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 11987.57ms. Allocated memory was 109.1MB in the beginning and 192.9MB in the end (delta: 83.9MB). Free memory was 57.7MB in the beginning and 141.8MB in the end (delta: -84.1MB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. * Witness Printer took 2.53ms. Allocated memory is still 192.9MB. Free memory is still 141.8MB. 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 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * nondetString2 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.9s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 10.0s. Construction of modules took 0.2s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 183 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 336 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 11 IncrementalHoareTripleChecker+Unchecked, 232 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 218 IncrementalHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 104 mSDtfsCounter, 218 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital178 mio100 ax111 hnf100 lsp83 ukn77 mio100 lsp59 div100 bol100 ite100 ukn100 eq166 hnf90 smp97 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 2 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:35:01,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:01,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE