./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/cstrncat-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/cstrncat-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 d8697c629a22dee8b5a51c26261db89d3e1115a5e0c1bc03fd54c09ffc3b9b0d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:34:56,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:34:56,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:34:56,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:34:56,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:34:56,419 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:34:56,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:34:56,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:34:56,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:34:56,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:34:56,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:34:56,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:34:56,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:34:56,431 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:34:56,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:34:56,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:34:56,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:34:56,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:34:56,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:34:56,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:34:56,442 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:34:56,443 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:34:56,444 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:34:56,445 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:34:56,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:34:56,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:34:56,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:34:56,452 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:34:56,452 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:34:56,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:34:56,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:34:56,453 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:34:56,454 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:34:56,456 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:34:56,457 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:34:56,457 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:34:56,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:34:56,458 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:34:56,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:34:56,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:34:56,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:34:56,460 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:56,480 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:34:56,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:34:56,482 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:34:56,482 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:34:56,483 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:34:56,483 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:34:56,483 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:34:56,483 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:34:56,483 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:34:56,484 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:34:56,484 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:34:56,485 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:34:56,485 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:34:56,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:34:56,485 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:34:56,485 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:34:56,485 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:34:56,486 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:34:56,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:34:56,486 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:34:56,486 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:34:56,486 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:34:56,486 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:34:56,486 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:34:56,487 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:34:56,487 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:34:56,487 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:34:56,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:34:56,487 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:34:56,487 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:34:56,488 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:34:56,488 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:34:56,488 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 -> d8697c629a22dee8b5a51c26261db89d3e1115a5e0c1bc03fd54c09ffc3b9b0d [2022-02-21 04:34:56,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:34:56,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:34:56,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:34:56,694 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:34:56,694 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:34:56,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrncat-alloca-2.i [2022-02-21 04:34:56,754 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fe9b4f66/77d0156e76b7441dab541ad1024a87a2/FLAGa908d6f61 [2022-02-21 04:34:57,171 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:34:57,171 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrncat-alloca-2.i [2022-02-21 04:34:57,180 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fe9b4f66/77d0156e76b7441dab541ad1024a87a2/FLAGa908d6f61 [2022-02-21 04:34:57,574 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fe9b4f66/77d0156e76b7441dab541ad1024a87a2 [2022-02-21 04:34:57,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:34:57,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:34:57,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:34:57,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:34:57,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:34:57,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:34:57" (1/1) ... [2022-02-21 04:34:57,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@647f6692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:57, skipping insertion in model container [2022-02-21 04:34:57,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:34:57" (1/1) ... [2022-02-21 04:34:57,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:34:57,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:34:57,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:34:57,903 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:34:57,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:34:57,963 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:34:57,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:57 WrapperNode [2022-02-21 04:34:57,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:34:57,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:34:57,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:34:57,968 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:34:57,975 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:57" (1/1) ... [2022-02-21 04:34:57,985 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:57" (1/1) ... [2022-02-21 04:34:58,011 INFO L137 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 102 [2022-02-21 04:34:58,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:34:58,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:34:58,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:34:58,012 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:34:58,017 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:57" (1/1) ... [2022-02-21 04:34:58,018 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:57" (1/1) ... [2022-02-21 04:34:58,033 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:57" (1/1) ... [2022-02-21 04:34:58,034 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:57" (1/1) ... [2022-02-21 04:34:58,040 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:57" (1/1) ... [2022-02-21 04:34:58,048 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:57" (1/1) ... [2022-02-21 04:34:58,054 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:57" (1/1) ... [2022-02-21 04:34:58,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:34:58,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:34:58,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:34:58,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:34:58,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:57" (1/1) ... [2022-02-21 04:34:58,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:58,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:58,108 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:58,113 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:58,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:34:58,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:34:58,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:34:58,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:34:58,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:34:58,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:34:58,270 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:34:58,271 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:34:58,477 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:34:58,481 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:34:58,481 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-21 04:34:58,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:34:58 BoogieIcfgContainer [2022-02-21 04:34:58,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:34:58,483 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:34:58,484 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:34:58,486 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:34:58,486 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:58,486 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:34:57" (1/3) ... [2022-02-21 04:34:58,487 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@421e8bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:34:58, skipping insertion in model container [2022-02-21 04:34:58,487 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:58,487 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:57" (2/3) ... [2022-02-21 04:34:58,488 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@421e8bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:34:58, skipping insertion in model container [2022-02-21 04:34:58,488 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:58,488 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:34:58" (3/3) ... [2022-02-21 04:34:58,489 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrncat-alloca-2.i [2022-02-21 04:34:58,516 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:34:58,516 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:34:58,517 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:34:58,517 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:34:58,517 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:34:58,517 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:34:58,517 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:34:58,517 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:34:58,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 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:58,547 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2022-02-21 04:34:58,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:58,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:58,551 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:34:58,551 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:58,552 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:34:58,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 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:58,558 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2022-02-21 04:34:58,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:58,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:58,560 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:34:58,560 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:58,565 INFO L791 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 16#L531true assume !(main_~length1~0#1 < 1); 18#L531-2true assume !(main_~length2~0#1 < 1); 3#L534-1true assume !(main_~n~0#1 < 1); 11#L537-1true assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 6#L544-3true [2022-02-21 04:34:58,565 INFO L793 eck$LassoCheckResult]: Loop: 6#L544-3true assume !!(main_~i~0#1 < main_~length1~0#1 - main_~n~0#1 - 1);call write~int(main_#t~nondet16#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; 8#L544-2true main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 6#L544-3true [2022-02-21 04:34:58,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:58,575 INFO L85 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2022-02-21 04:34:58,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:58,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066311805] [2022-02-21 04:34:58,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:58,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:58,693 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:58,731 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:58,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:58,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2019, now seen corresponding path program 1 times [2022-02-21 04:34:58,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:58,735 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016687093] [2022-02-21 04:34:58,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:58,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:58,752 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:58,762 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:58,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:58,764 INFO L85 PathProgramCache]: Analyzing trace with hash 180553841, now seen corresponding path program 1 times [2022-02-21 04:34:58,764 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:58,764 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603656767] [2022-02-21 04:34:58,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:58,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:58,793 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:58,825 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:59,158 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:34:59,159 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:34:59,159 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:34:59,159 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:34:59,160 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:34:59,160 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:59,160 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:34:59,160 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:34:59,160 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncat-alloca-2.i_Iteration1_Lasso [2022-02-21 04:34:59,160 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:34:59,160 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:34:59,173 INFO L141 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,178 INFO L141 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,180 INFO L141 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,184 INFO L141 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,186 INFO L141 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,353 INFO L141 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,356 INFO L141 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,359 INFO L141 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,361 INFO L141 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,362 INFO L141 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,364 INFO L141 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,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:59,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:59,370 INFO L141 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,372 INFO L141 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,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:59,375 INFO L141 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,762 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:34:59,765 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:34:59,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:59,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:59,768 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:59,771 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:59,772 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,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:59,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:59,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:59,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:59,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:59,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:59,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:59,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:59,822 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:59,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:59,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:59,825 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:59,827 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:59,828 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,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:59,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:59,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:59,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:59,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:59,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:59,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:59,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:59,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 04:34:59,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:59,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:59,902 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:59,903 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:59,904 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 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,916 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:59,916 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:59,942 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:59,958 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:59,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:59,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:59,961 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:59,962 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:59,963 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,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:59,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:59,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:59,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:59,971 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:59,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:59,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:59,997 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:59,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:59,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:59,999 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:35:00,001 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,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:00,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:00,029 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:00,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,048 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:35:00,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:00,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:00,076 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:00,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,095 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:35:00,100 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,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:00,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:00,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:35: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,172 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:35:00,174 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,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,187 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:00,187 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:00,211 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:00,244 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-02-21 04:35:00,244 INFO L444 ModelExtractionUtils]: 9 out of 31 variables were initially zero. Simplification set additionally 18 variables to zero. [2022-02-21 04:35:00,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,256 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:00,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:35:00,259 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:00,280 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:00,281 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:00,281 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nondetString1~0#1.offset, ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_1) = -1*ULTIMATE.start_main_~nondetString1~0#1.offset - 1*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_1 Supporting invariants [] [2022-02-21 04:35:00,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:00,365 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 04:35:00,371 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length1~0#1 - main_~n~0#1 - 1);call write~int(main_#t~nondet16#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;" "main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1;" [2022-02-21 04:35:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:00,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:00,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:00,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:00,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {34#unseeded} is VALID [2022-02-21 04:35:00,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {34#unseeded} is VALID [2022-02-21 04:35:00,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#unseeded} assume !(main_~length1~0#1 < 1); {34#unseeded} is VALID [2022-02-21 04:35:00,437 INFO L290 TraceCheckUtils]: 3: Hoare triple {34#unseeded} assume !(main_~length2~0#1 < 1); {34#unseeded} is VALID [2022-02-21 04:35:00,437 INFO L290 TraceCheckUtils]: 4: Hoare triple {34#unseeded} assume !(main_~n~0#1 < 1); {34#unseeded} is VALID [2022-02-21 04:35:00,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#unseeded} assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {78#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) unseeded)} is VALID [2022-02-21 04:35:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:00,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 04:35:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:00,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:00,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {79#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset|))))} assume !!(main_~i~0#1 < main_~length1~0#1 - main_~n~0#1 - 1);call write~int(main_#t~nondet16#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; {102#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~i~0#1| 1) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset|))))} is VALID [2022-02-21 04:35:00,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {102#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~i~0#1| 1) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset|))))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {81#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset|))))))} is VALID [2022-02-21 04:35:00,474 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:00,489 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:35:00,497 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:35:00,498 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:35:00,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,503 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:35:00,504 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 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:35:00,618 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 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 58 states and 86 transitions. Complement of second has 8 states. [2022-02-21 04:35:00,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:00,618 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:00,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 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:00,620 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2022-02-21 04:35:00,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:00,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:00,621 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:35:00,623 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:00,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:00,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:00,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 86 transitions. [2022-02-21 04:35:00,625 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 04:35:00,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:00,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:00,627 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 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:00,628 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2022-02-21 04:35:00,630 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 04:35:00,630 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:35:00,632 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:00,632 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:00,632 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 58 states and 86 transitions. cyclomatic complexity: 38 [2022-02-21 04:35:00,633 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 04:35:00,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:00,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,634 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:35:00,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:00,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:00,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,635 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:35:00,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:00,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:00,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,636 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:35:00,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:00,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 58 letters. [2022-02-21 04:35:00,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,637 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 58 letters. Loop has 58 letters. [2022-02-21 04:35:00,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 58 letters. Loop has 58 letters. [2022-02-21 04:35:00,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:35:00,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,638 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 24 letters. Loop has 24 letters. [2022-02-21 04:35:00,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 24 letters. Loop has 24 letters. [2022-02-21 04:35:00,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:00,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,639 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:35:00,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:00,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 04:35:00,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,640 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 3 letters. [2022-02-21 04:35:00,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:00,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:00,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,641 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 3 letters. [2022-02-21 04:35:00,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:00,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:00,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,643 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 3 letters. [2022-02-21 04:35:00,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:00,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:35:00,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,660 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:35:00,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:35:00,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:35:00,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,661 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:35:00,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:00,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:00,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,662 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:35:00,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:00,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:35:00,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,663 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:35:00,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:00,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:00,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,664 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:35:00,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:00,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:00,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,665 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:35:00,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:00,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:00,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,666 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:35:00,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:00,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:00,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,667 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:35:00,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:00,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 04:35:00,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,668 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 3 letters. [2022-02-21 04:35:00,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:00,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:00,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,669 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 3 letters. [2022-02-21 04:35:00,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:00,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:00,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,670 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 14 letters. Loop has 3 letters. [2022-02-21 04:35:00,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:00,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:35:00,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,670 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:35:00,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:35:00,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:35:00,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,671 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:35:00,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:00,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:00,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,672 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:35:00,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:00,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:35:00,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,673 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:35:00,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 86 transitions. cyclomatic complexity: 38 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:00,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,674 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:00,677 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:35:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-02-21 04:35:00,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:00,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:00,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:35:00,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:00,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 86 transitions. cyclomatic complexity: 38 [2022-02-21 04:35:00,703 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 04:35:00,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 18 states and 26 transitions. [2022-02-21 04:35:00,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-02-21 04:35:00,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 04:35:00,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2022-02-21 04:35:00,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:00,707 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-02-21 04:35:00,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2022-02-21 04:35:00,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-21 04:35:00,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:00,723 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:35:00,724 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:35:00,725 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:35:00,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:00,731 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2022-02-21 04:35:00,731 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2022-02-21 04:35:00,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:00,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:00,733 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:35:00,733 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:35:00,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:00,733 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2022-02-21 04:35:00,733 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2022-02-21 04:35:00,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:00,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:00,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:00,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:00,735 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:35:00,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2022-02-21 04:35:00,736 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-02-21 04:35:00,736 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-02-21 04:35:00,736 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:35:00,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2022-02-21 04:35:00,737 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 04:35:00,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:00,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:00,738 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:00,738 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:00,738 INFO L791 eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 183#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 190#L531 assume !(main_~length1~0#1 < 1); 191#L531-2 assume !(main_~length2~0#1 < 1); 176#L534-1 assume !(main_~n~0#1 < 1); 177#L537-1 assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 178#L544-3 assume !(main_~i~0#1 < main_~length1~0#1 - main_~n~0#1 - 1); 180#L544-4 main_~i~1#1 := 0; 184#L549-3 [2022-02-21 04:35:00,738 INFO L793 eck$LassoCheckResult]: Loop: 184#L549-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet18#1; 186#L549-2 main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 184#L549-3 [2022-02-21 04:35:00,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:00,739 INFO L85 PathProgramCache]: Analyzing trace with hash 180553783, now seen corresponding path program 1 times [2022-02-21 04:35:00,739 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:00,739 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085662928] [2022-02-21 04:35:00,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:00,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:00,769 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:00,802 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:00,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:00,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2467, now seen corresponding path program 1 times [2022-02-21 04:35:00,802 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:00,802 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820145390] [2022-02-21 04:35:00,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:00,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:00,809 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:00,812 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:00,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:00,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1713495129, now seen corresponding path program 1 times [2022-02-21 04:35:00,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:00,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732789490] [2022-02-21 04:35:00,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:00,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:00,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {237#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {237#true} is VALID [2022-02-21 04:35:00,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {237#true} is VALID [2022-02-21 04:35:00,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {237#true} assume !(main_~length1~0#1 < 1); {237#true} is VALID [2022-02-21 04:35:00,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {237#true} assume !(main_~length2~0#1 < 1); {237#true} is VALID [2022-02-21 04:35:00,876 INFO L290 TraceCheckUtils]: 4: Hoare triple {237#true} assume !(main_~n~0#1 < 1); {237#true} is VALID [2022-02-21 04:35:00,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {237#true} assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {239#(and (<= (+ |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~length1~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-21 04:35:00,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(and (<= (+ |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~length1~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0))} assume !(main_~i~0#1 < main_~length1~0#1 - main_~n~0#1 - 1); {240#(<= |ULTIMATE.start_main_~length2~0#1| 1)} is VALID [2022-02-21 04:35:00,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#(<= |ULTIMATE.start_main_~length2~0#1| 1)} main_~i~1#1 := 0; {241#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~length2~0#1| 1))} is VALID [2022-02-21 04:35:00,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {241#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~length2~0#1| 1))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet18#1; {238#false} is VALID [2022-02-21 04:35:00,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {238#false} main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {238#false} is VALID [2022-02-21 04:35:00,879 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:00,879 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:00,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732789490] [2022-02-21 04:35:00,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732789490] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:00,880 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:00,880 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:35:00,880 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643006035] [2022-02-21 04:35:00,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:00,917 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:00,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:35:00,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:35:00,919 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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:35:01,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:01,039 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-02-21 04:35:01,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 04:35:01,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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:35:01,049 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:35:01,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 56 transitions. [2022-02-21 04:35:01,051 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 17 [2022-02-21 04:35:01,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 56 transitions. [2022-02-21 04:35:01,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-02-21 04:35:01,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2022-02-21 04:35:01,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 56 transitions. [2022-02-21 04:35:01,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:01,053 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 56 transitions. [2022-02-21 04:35:01,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 56 transitions. [2022-02-21 04:35:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 25. [2022-02-21 04:35:01,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:01,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states and 56 transitions. Second operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 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,055 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states and 56 transitions. Second operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 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,055 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 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,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:01,056 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-02-21 04:35:01,056 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2022-02-21 04:35:01,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:01,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:01,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 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 41 states and 56 transitions. [2022-02-21 04:35:01,057 INFO L87 Difference]: Start difference. First operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 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 41 states and 56 transitions. [2022-02-21 04:35:01,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:01,058 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-02-21 04:35:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2022-02-21 04:35:01,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:01,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:01,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:01,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:01,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 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,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2022-02-21 04:35:01,059 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2022-02-21 04:35:01,059 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2022-02-21 04:35:01,059 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:35:01,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2022-02-21 04:35:01,060 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 04:35:01,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:01,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:01,060 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:01,060 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:01,061 INFO L791 eck$LassoCheckResult]: Stem: 295#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 296#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 304#L531 assume !(main_~length1~0#1 < 1); 305#L531-2 assume main_~length2~0#1 < 1;main_~length2~0#1 := 1; 287#L534-1 assume !(main_~n~0#1 < 1); 288#L537-1 assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 311#L544-3 assume !(main_~i~0#1 < main_~length1~0#1 - main_~n~0#1 - 1); 291#L544-4 main_~i~1#1 := 0; 297#L549-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 298#L549-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - main_~n~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrncat } true;cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset, cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset, cstrncat_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~0#1;havoc cstrncat_#res#1.base, cstrncat_#res#1.offset;havoc cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset, cstrncat_#t~mem2#1, cstrncat_#t~post7#1, cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset, cstrncat_#t~post4#1.base, cstrncat_#t~post4#1.offset, cstrncat_#t~mem5#1, cstrncat_#t~short6#1, cstrncat_#t~mem9#1, cstrncat_~s1#1.base, cstrncat_~s1#1.offset, cstrncat_~s2#1.base, cstrncat_~s2#1.offset, cstrncat_~n#1, cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s1#1.base, cstrncat_~s1#1.offset := cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset;cstrncat_~s2#1.base, cstrncat_~s2#1.offset := cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset;cstrncat_~n#1 := cstrncat_#in~n#1;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_~s1#1.base, cstrncat_~s1#1.offset; 300#L517-3 [2022-02-21 04:35:01,061 INFO L793 eck$LassoCheckResult]: Loop: 300#L517-3 call cstrncat_#t~mem2#1 := read~int(cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset, 1); 303#L517-1 assume !!(0 != cstrncat_#t~mem2#1);havoc cstrncat_#t~mem2#1;cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post3#1.base, 1 + cstrncat_#t~post3#1.offset;havoc cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset; 300#L517-3 [2022-02-21 04:35:01,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:01,061 INFO L85 PathProgramCache]: Analyzing trace with hash -61512291, now seen corresponding path program 1 times [2022-02-21 04:35:01,061 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:01,061 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618673249] [2022-02-21 04:35:01,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:01,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,108 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,130 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:01,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:01,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 1 times [2022-02-21 04:35:01,130 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:01,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441966977] [2022-02-21 04:35:01,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:01,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:01,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,139 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,145 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:01,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:01,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1016232354, now seen corresponding path program 1 times [2022-02-21 04:35:01,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:01,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130825197] [2022-02-21 04:35:01,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:01,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:01,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {401#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {401#true} is VALID [2022-02-21 04:35:01,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {401#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {401#true} is VALID [2022-02-21 04:35:01,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {401#true} assume !(main_~length1~0#1 < 1); {401#true} is VALID [2022-02-21 04:35:01,304 INFO L290 TraceCheckUtils]: 3: Hoare triple {401#true} assume main_~length2~0#1 < 1;main_~length2~0#1 := 1; {401#true} is VALID [2022-02-21 04:35:01,304 INFO L290 TraceCheckUtils]: 4: Hoare triple {401#true} assume !(main_~n~0#1 < 1); {401#true} is VALID [2022-02-21 04:35:01,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {401#true} assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {403#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (or (= |ULTIMATE.start_main_~nondetString1~0#1.offset| (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|))) (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0)) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0)))} is VALID [2022-02-21 04:35:01,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {403#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (or (= |ULTIMATE.start_main_~nondetString1~0#1.offset| (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|))) (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0)) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0)))} assume !(main_~i~0#1 < main_~length1~0#1 - main_~n~0#1 - 1); {404#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-21 04:35:01,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {404#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) (+ |ULTIMATE.start_main_~n~0#1| 1)))} main_~i~1#1 := 0; {404#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-21 04:35:01,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {404#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) (+ |ULTIMATE.start_main_~n~0#1| 1)))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {404#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-21 04:35:01,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {404#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) (+ |ULTIMATE.start_main_~n~0#1| 1)))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - main_~n~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrncat } true;cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset, cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset, cstrncat_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~0#1;havoc cstrncat_#res#1.base, cstrncat_#res#1.offset;havoc cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset, cstrncat_#t~mem2#1, cstrncat_#t~post7#1, cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset, cstrncat_#t~post4#1.base, cstrncat_#t~post4#1.offset, cstrncat_#t~mem5#1, cstrncat_#t~short6#1, cstrncat_#t~mem9#1, cstrncat_~s1#1.base, cstrncat_~s1#1.offset, cstrncat_~s2#1.base, cstrncat_~s2#1.offset, cstrncat_~n#1, cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s1#1.base, cstrncat_~s1#1.offset := cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset;cstrncat_~s2#1.base, cstrncat_~s2#1.offset := cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset;cstrncat_~n#1 := cstrncat_#in~n#1;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_~s1#1.base, cstrncat_~s1#1.offset; {405#(= (select (select |#memory_int| |ULTIMATE.start_cstrncat_~s~0#1.base|) |ULTIMATE.start_cstrncat_~s~0#1.offset|) 0)} is VALID [2022-02-21 04:35:01,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {405#(= (select (select |#memory_int| |ULTIMATE.start_cstrncat_~s~0#1.base|) |ULTIMATE.start_cstrncat_~s~0#1.offset|) 0)} call cstrncat_#t~mem2#1 := read~int(cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset, 1); {406#(= |ULTIMATE.start_cstrncat_#t~mem2#1| 0)} is VALID [2022-02-21 04:35:01,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {406#(= |ULTIMATE.start_cstrncat_#t~mem2#1| 0)} assume !!(0 != cstrncat_#t~mem2#1);havoc cstrncat_#t~mem2#1;cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post3#1.base, 1 + cstrncat_#t~post3#1.offset;havoc cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset; {402#false} is VALID [2022-02-21 04:35:01,309 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,309 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:01,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130825197] [2022-02-21 04:35:01,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130825197] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:01,309 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:01,309 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:35:01,310 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590739711] [2022-02-21 04:35:01,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:01,341 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:01,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 04:35:01,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 04:35:01,342 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. cyclomatic complexity: 16 Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:01,555 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2022-02-21 04:35:01,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 04:35:01,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:01,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:01,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 51 transitions. [2022-02-21 04:35:01,568 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2022-02-21 04:35:01,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 51 transitions. [2022-02-21 04:35:01,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-02-21 04:35:01,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2022-02-21 04:35:01,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 51 transitions. [2022-02-21 04:35:01,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:01,569 INFO L681 BuchiCegarLoop]: Abstraction has 38 states and 51 transitions. [2022-02-21 04:35:01,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 51 transitions. [2022-02-21 04:35:01,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2022-02-21 04:35:01,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:01,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states and 51 transitions. Second operand has 30 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 29 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:35:01,571 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states and 51 transitions. Second operand has 30 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 29 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:35:01,571 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 30 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 29 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:35:01,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:01,572 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2022-02-21 04:35:01,572 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2022-02-21 04:35:01,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:01,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:01,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 29 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 38 states and 51 transitions. [2022-02-21 04:35:01,572 INFO L87 Difference]: Start difference. First operand has 30 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 29 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 38 states and 51 transitions. [2022-02-21 04:35:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:01,573 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2022-02-21 04:35:01,573 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2022-02-21 04:35:01,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:01,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:01,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:01,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:01,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 29 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:35:01,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2022-02-21 04:35:01,574 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2022-02-21 04:35:01,574 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2022-02-21 04:35:01,574 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:35:01,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 41 transitions. [2022-02-21 04:35:01,575 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 04:35:01,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:01,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:01,575 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:01,575 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:01,575 INFO L791 eck$LassoCheckResult]: Stem: 459#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 460#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 469#L531 assume !(main_~length1~0#1 < 1); 470#L531-2 assume !(main_~length2~0#1 < 1); 472#L534-1 assume !(main_~n~0#1 < 1); 477#L537-1 assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 453#L544-3 assume !!(main_~i~0#1 < main_~length1~0#1 - main_~n~0#1 - 1);call write~int(main_#t~nondet16#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; 454#L544-2 main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 461#L544-3 assume !(main_~i~0#1 < main_~length1~0#1 - main_~n~0#1 - 1); 476#L544-4 main_~i~1#1 := 0; 474#L549-3 [2022-02-21 04:35:01,575 INFO L793 eck$LassoCheckResult]: Loop: 474#L549-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet18#1; 473#L549-2 main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 474#L549-3 [2022-02-21 04:35:01,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:01,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1713550361, now seen corresponding path program 1 times [2022-02-21 04:35:01,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:01,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834575907] [2022-02-21 04:35:01,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:01,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,588 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,595 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:01,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:01,595 INFO L85 PathProgramCache]: Analyzing trace with hash 2467, now seen corresponding path program 2 times [2022-02-21 04:35:01,595 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:01,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146276827] [2022-02-21 04:35:01,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:01,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,601 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,603 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:01,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:01,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1749424059, now seen corresponding path program 1 times [2022-02-21 04:35:01,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:01,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006798063] [2022-02-21 04:35:01,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:01,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,616 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,625 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:01,926 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:01,926 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:01,926 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:01,937 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:01,937 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:01,937 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:01,937 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:01,938 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:01,938 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncat-alloca-2.i_Iteration4_Lasso [2022-02-21 04:35:01,938 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:01,938 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:01,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:01,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:01,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:01,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:01,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:01,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:01,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:01,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:01,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:02,160 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:35:02,162 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:35:02,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:02,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:02,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:02,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:02,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:02,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:02,513 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:02,513 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:02,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:02,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:02,514 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:02,534 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:02,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:02,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:02,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:02,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:02,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:02,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:02,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 04:35:02,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:02,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:02,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:02,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:02,595 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:02,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 04:35:02,598 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:02,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:02,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:02,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:02,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:02,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:02,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:02,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:02,619 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:02,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:02,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:02,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:02,636 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:02,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 04:35:02,639 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:02,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:02,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:02,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:02,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:02,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:02,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:02,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:02,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:02,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:02,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:02,693 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:02,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:35:02,696 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:02,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:02,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:02,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:02,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:02,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:02,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:02,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:02,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:02,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:02,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:02,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:02,746 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:02,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:35:02,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:02,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:02,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:02,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:02,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:02,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:02,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:02,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:02,756 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:02,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:02,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:02,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:02,775 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:02,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:35:02,777 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:02,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:02,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:02,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:02,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:02,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:02,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:02,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:02,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:02,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 04:35:02,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:02,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:02,802 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:02,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:35:02,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:02,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:02,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:02,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:02,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:02,827 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:02,827 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:02,845 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:02,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:02,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:02,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:02,879 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:02,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:35:02,881 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:02,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:02,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:02,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:02,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:02,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:02,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:02,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:02,894 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:02,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:02,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:02,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:02,911 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:02,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:35:02,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:02,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:02,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:02,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:02,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:02,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:02,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:02,963 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:02,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-02-21 04:35:02,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:02,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:02,998 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:03,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:35:03,012 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:03,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:03,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:03,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:03,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:03,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:03,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:03,043 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:03,085 INFO L443 ModelExtractionUtils]: Simplification made 27 calls to the SMT solver. [2022-02-21 04:35:03,085 INFO L444 ModelExtractionUtils]: 12 out of 40 variables were initially zero. Simplification set additionally 25 variables to zero. [2022-02-21 04:35:03,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:03,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:03,095 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:03,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 04:35:03,097 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:03,132 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:03,132 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:03,132 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~length2~0#1) = -1*ULTIMATE.start_main_~i~1#1 + 1*ULTIMATE.start_main_~length2~0#1 Supporting invariants [] [2022-02-21 04:35:03,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:03,170 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2022-02-21 04:35:03,173 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet18#1;" "main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" [2022-02-21 04:35:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:03,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:03,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:35:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:03,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:03,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {566#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {566#unseeded} is VALID [2022-02-21 04:35:03,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {566#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {566#unseeded} is VALID [2022-02-21 04:35:03,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {566#unseeded} assume !(main_~length1~0#1 < 1); {566#unseeded} is VALID [2022-02-21 04:35:03,231 INFO L290 TraceCheckUtils]: 3: Hoare triple {566#unseeded} assume !(main_~length2~0#1 < 1); {566#unseeded} is VALID [2022-02-21 04:35:03,231 INFO L290 TraceCheckUtils]: 4: Hoare triple {566#unseeded} assume !(main_~n~0#1 < 1); {566#unseeded} is VALID [2022-02-21 04:35:03,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {566#unseeded} assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {566#unseeded} is VALID [2022-02-21 04:35:03,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {566#unseeded} assume !!(main_~i~0#1 < main_~length1~0#1 - main_~n~0#1 - 1);call write~int(main_#t~nondet16#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; {566#unseeded} is VALID [2022-02-21 04:35:03,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {566#unseeded} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {566#unseeded} is VALID [2022-02-21 04:35:03,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {566#unseeded} assume !(main_~i~0#1 < main_~length1~0#1 - main_~n~0#1 - 1); {566#unseeded} is VALID [2022-02-21 04:35:03,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {566#unseeded} main_~i~1#1 := 0; {566#unseeded} is VALID [2022-02-21 04:35:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:03,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:03,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:03,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {569#(>= oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|)))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet18#1; {646#(and (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length2~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|))))} is VALID [2022-02-21 04:35:03,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {646#(and (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length2~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|))))} main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {614#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|)))) unseeded)} is VALID [2022-02-21 04:35:03,254 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:03,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:03,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:03,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,259 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:35:03,259 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,331 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 60 transitions. Complement of second has 6 states. [2022-02-21 04:35:03,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:03,331 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:03,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 41 transitions. cyclomatic complexity: 16 [2022-02-21 04:35:03,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:03,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:03,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:03,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:03,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:03,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 60 transitions. [2022-02-21 04:35:03,333 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:35:03,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:03,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:03,333 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 41 transitions. cyclomatic complexity: 16 [2022-02-21 04:35:03,334 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 04:35:03,334 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:03,334 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:03,334 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 60 transitions. cyclomatic complexity: 26 [2022-02-21 04:35:03,335 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 04:35:03,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:03,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:03,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 60 transitions. cyclomatic complexity: 26 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:03,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:03,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:03,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 60 transitions. cyclomatic complexity: 26 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:03,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:03,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:03,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 60 transitions. cyclomatic complexity: 26 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:03,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 16 Stem has 41 letters. Loop has 41 letters. [2022-02-21 04:35:03,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 41 letters. [2022-02-21 04:35:03,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 60 transitions. cyclomatic complexity: 26 Stem has 41 letters. Loop has 41 letters. [2022-02-21 04:35:03,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 16 Stem has 30 letters. Loop has 30 letters. [2022-02-21 04:35:03,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 30 letters. [2022-02-21 04:35:03,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 60 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 30 letters. [2022-02-21 04:35:03,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:03,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:03,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 60 transitions. cyclomatic complexity: 26 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:03,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:03,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:03,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 60 transitions. cyclomatic complexity: 26 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:03,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:03,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:03,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 60 transitions. cyclomatic complexity: 26 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:03,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:03,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:03,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 60 transitions. cyclomatic complexity: 26 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:03,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:03,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:03,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 60 transitions. cyclomatic complexity: 26 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:03,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:03,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:03,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 60 transitions. cyclomatic complexity: 26 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:03,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:35:03,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:35:03,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 60 transitions. cyclomatic complexity: 26 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:35:03,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:03,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:03,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 60 transitions. cyclomatic complexity: 26 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:03,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:03,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:03,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 60 transitions. cyclomatic complexity: 26 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:03,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:03,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:03,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 60 transitions. cyclomatic complexity: 26 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:03,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:03,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:03,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 60 transitions. cyclomatic complexity: 26 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:03,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:03,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:03,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 60 transitions. cyclomatic complexity: 26 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:03,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:03,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:03,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 60 transitions. cyclomatic complexity: 26 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:03,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:03,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:03,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 60 transitions. cyclomatic complexity: 26 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:03,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,369 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:03,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-21 04:35:03,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:03,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:03,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 10 letters. Loop has 4 letters. [2022-02-21 04:35:03,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 60 transitions. cyclomatic complexity: 26 [2022-02-21 04:35:03,371 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:35:03,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 31 states and 43 transitions. [2022-02-21 04:35:03,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-02-21 04:35:03,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-02-21 04:35:03,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 43 transitions. [2022-02-21 04:35:03,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:03,373 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2022-02-21 04:35:03,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 43 transitions. [2022-02-21 04:35:03,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-21 04:35:03,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:03,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states and 43 transitions. Second operand has 31 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 30 states have internal predecessors, (43), 0 states have call successors, (0), 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:03,374 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states and 43 transitions. Second operand has 31 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 30 states have internal predecessors, (43), 0 states have call successors, (0), 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:03,374 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand has 31 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 30 states have internal predecessors, (43), 0 states have call successors, (0), 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:03,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:03,375 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2022-02-21 04:35:03,375 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2022-02-21 04:35:03,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:03,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:03,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 30 states have internal predecessors, (43), 0 states have call successors, (0), 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 31 states and 43 transitions. [2022-02-21 04:35:03,375 INFO L87 Difference]: Start difference. First operand has 31 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 30 states have internal predecessors, (43), 0 states have call successors, (0), 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 31 states and 43 transitions. [2022-02-21 04:35:03,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:03,376 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2022-02-21 04:35:03,376 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2022-02-21 04:35:03,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:03,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:03,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:03,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:03,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 30 states have internal predecessors, (43), 0 states have call successors, (0), 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:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2022-02-21 04:35:03,377 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2022-02-21 04:35:03,377 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2022-02-21 04:35:03,377 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:35:03,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 43 transitions. [2022-02-21 04:35:03,377 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:35:03,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:03,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:03,378 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:03,378 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:03,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:03,384 INFO L791 eck$LassoCheckResult]: Stem: 707#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 708#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 716#L531 assume !(main_~length1~0#1 < 1); 717#L531-2 assume main_~length2~0#1 < 1;main_~length2~0#1 := 1; 700#L534-1 assume !(main_~n~0#1 < 1); 701#L537-1 assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 702#L544-3 assume !!(main_~i~0#1 < main_~length1~0#1 - main_~n~0#1 - 1);call write~int(main_#t~nondet16#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; 703#L544-2 main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 705#L544-3 assume !(main_~i~0#1 < main_~length1~0#1 - main_~n~0#1 - 1); 706#L544-4 main_~i~1#1 := 0; 709#L549-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 710#L549-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - main_~n~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrncat } true;cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset, cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset, cstrncat_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~0#1;havoc cstrncat_#res#1.base, cstrncat_#res#1.offset;havoc cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset, cstrncat_#t~mem2#1, cstrncat_#t~post7#1, cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset, cstrncat_#t~post4#1.base, cstrncat_#t~post4#1.offset, cstrncat_#t~mem5#1, cstrncat_#t~short6#1, cstrncat_#t~mem9#1, cstrncat_~s1#1.base, cstrncat_~s1#1.offset, cstrncat_~s2#1.base, cstrncat_~s2#1.offset, cstrncat_~n#1, cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s1#1.base, cstrncat_~s1#1.offset := cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset;cstrncat_~s2#1.base, cstrncat_~s2#1.offset := cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset;cstrncat_~n#1 := cstrncat_#in~n#1;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_~s1#1.base, cstrncat_~s1#1.offset; 713#L517-3 [2022-02-21 04:35:03,384 INFO L793 eck$LassoCheckResult]: Loop: 713#L517-3 call cstrncat_#t~mem2#1 := read~int(cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset, 1); 721#L517-1 assume !!(0 != cstrncat_#t~mem2#1);havoc cstrncat_#t~mem2#1;cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post3#1.base, 1 + cstrncat_#t~post3#1.offset;havoc cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset; 713#L517-3 [2022-02-21 04:35:03,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:03,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1069365631, now seen corresponding path program 1 times [2022-02-21 04:35:03,386 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:03,386 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281240884] [2022-02-21 04:35:03,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:03,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:03,399 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:03,407 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:03,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:03,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 2 times [2022-02-21 04:35:03,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:03,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268286813] [2022-02-21 04:35:03,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:03,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:03,410 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:03,412 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:03,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:03,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1163189508, now seen corresponding path program 1 times [2022-02-21 04:35:03,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:03,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526422437] [2022-02-21 04:35:03,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:03,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:03,426 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:03,436 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:04,015 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:04,015 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:04,015 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:04,015 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:04,015 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:04,015 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:04,015 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:04,015 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:04,015 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncat-alloca-2.i_Iteration5_Lasso [2022-02-21 04:35:04,015 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:04,015 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:04,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,484 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:35:04,487 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:35:04,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,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:35:04,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,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:35:04,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:04,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:05,239 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:05,239 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:05,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,241 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:05,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 04:35:05,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:05,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:05,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:05,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:05,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:05,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,268 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:05,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 04:35:05,270 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:05,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,277 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:05,277 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:05,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:05,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,310 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:05,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 04:35:05,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:05,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:05,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:05,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:05,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:05,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,352 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:05,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 04:35:05,354 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:05,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:05,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:05,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:05,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,393 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:05,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 04:35:05,397 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:05,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:05,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:05,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:05,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 04:35:05,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,430 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:05,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 04:35:05,432 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:05,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:05,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:05,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:05,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 04:35:05,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,457 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:05,459 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:05,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:05,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:05,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:05,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 04:35:05,468 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-02-21 04:35:05,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,485 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:05,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 04:35:05,488 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:05,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:05,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:05,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:05,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:05,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,529 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:05,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 04:35:05,531 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:05,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:05,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:05,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:05,549 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,565 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:35:05,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,567 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:05,585 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:05,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:05,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:05,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 04:35:05,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:05,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,618 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:05,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 04:35:05,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:05,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:05,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:05,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:05,638 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-02-21 04:35:05,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,656 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:05,657 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:05,659 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:05,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:05,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:05,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:05,666 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,684 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:05,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,685 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:05,686 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:05,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:05,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:05,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:05,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:05,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,711 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:05,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,713 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:05,714 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:05,715 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:05,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:05,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:05,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:05,736 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:05,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,754 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:05,755 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:05,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:35:05,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:05,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:05,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:05,764 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,782 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:05,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,783 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:05,784 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:05,786 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:05,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,794 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:05,794 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:05,809 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,827 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:05,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,828 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:05,829 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:05,830 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:05,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:05,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:05,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:05,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:05,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,857 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:05,858 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:05,860 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:05,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:05,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:05,882 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:05,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,900 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:05,904 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:05,904 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:05,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,911 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 04:35:05,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,914 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 04:35:05,914 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:35:05,921 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,937 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:05,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,939 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:05,940 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:05,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:05,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:05,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:05,952 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,968 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:05,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,970 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:05,970 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:05,972 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:05,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,986 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:05,986 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:05,994 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:06,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:06,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,011 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:06,012 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:06,013 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:06,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:06,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:06,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:06,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:06,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:06,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:06,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:06,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:06,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,042 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:06,043 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:06,045 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:06,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:06,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:06,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:06,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:06,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:06,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:06,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:06,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:06,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,096 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:06,097 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:06,098 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:06,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:06,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:06,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:06,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:06,106 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:06,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:06,121 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:06,138 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:06,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,139 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:06,140 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:06,141 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:06,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:06,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:06,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:06,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:06,163 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:06,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:06,189 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:06,236 INFO L443 ModelExtractionUtils]: Simplification made 34 calls to the SMT solver. [2022-02-21 04:35:06,236 INFO L444 ModelExtractionUtils]: 11 out of 58 variables were initially zero. Simplification set additionally 44 variables to zero. [2022-02-21 04:35:06,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,239 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:06,240 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:06,241 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:06,247 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:06,247 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:06,247 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncat_~s~0#1.offset, v_rep(select #length ULTIMATE.start_cstrncat_~s~0#1.base)_1) = -1*ULTIMATE.start_cstrncat_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_cstrncat_~s~0#1.base)_1 Supporting invariants [] [2022-02-21 04:35:06,272 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:06,333 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-02-21 04:35:06,336 INFO L390 LassoCheck]: Loop: "call cstrncat_#t~mem2#1 := read~int(cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset, 1);" "assume !!(0 != cstrncat_#t~mem2#1);havoc cstrncat_#t~mem2#1;cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post3#1.base, 1 + cstrncat_#t~post3#1.offset;havoc cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset;" [2022-02-21 04:35:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:06,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:06,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:35:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:06,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:06,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {802#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {802#unseeded} is VALID [2022-02-21 04:35:06,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {802#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {802#unseeded} is VALID [2022-02-21 04:35:06,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {802#unseeded} assume !(main_~length1~0#1 < 1); {802#unseeded} is VALID [2022-02-21 04:35:06,404 INFO L290 TraceCheckUtils]: 3: Hoare triple {802#unseeded} assume main_~length2~0#1 < 1;main_~length2~0#1 := 1; {802#unseeded} is VALID [2022-02-21 04:35:06,404 INFO L290 TraceCheckUtils]: 4: Hoare triple {802#unseeded} assume !(main_~n~0#1 < 1); {802#unseeded} is VALID [2022-02-21 04:35:06,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {802#unseeded} assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {802#unseeded} is VALID [2022-02-21 04:35:06,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {802#unseeded} assume !!(main_~i~0#1 < main_~length1~0#1 - main_~n~0#1 - 1);call write~int(main_#t~nondet16#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; {802#unseeded} is VALID [2022-02-21 04:35:06,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {802#unseeded} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {802#unseeded} is VALID [2022-02-21 04:35:06,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {802#unseeded} assume !(main_~i~0#1 < main_~length1~0#1 - main_~n~0#1 - 1); {802#unseeded} is VALID [2022-02-21 04:35:06,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {802#unseeded} main_~i~1#1 := 0; {802#unseeded} is VALID [2022-02-21 04:35:06,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {802#unseeded} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {802#unseeded} is VALID [2022-02-21 04:35:06,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {802#unseeded} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - main_~n~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrncat } true;cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset, cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset, cstrncat_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~0#1;havoc cstrncat_#res#1.base, cstrncat_#res#1.offset;havoc cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset, cstrncat_#t~mem2#1, cstrncat_#t~post7#1, cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset, cstrncat_#t~post4#1.base, cstrncat_#t~post4#1.offset, cstrncat_#t~mem5#1, cstrncat_#t~short6#1, cstrncat_#t~mem9#1, cstrncat_~s1#1.base, cstrncat_~s1#1.offset, cstrncat_~s2#1.base, cstrncat_~s2#1.offset, cstrncat_~n#1, cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s1#1.base, cstrncat_~s1#1.offset := cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset;cstrncat_~s2#1.base, cstrncat_~s2#1.offset := cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset;cstrncat_~n#1 := cstrncat_#in~n#1;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_~s1#1.base, cstrncat_~s1#1.offset; {802#unseeded} is VALID [2022-02-21 04:35:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:06,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 04:35:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:06,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:06,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {805#(>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrncat_~s~0#1.base|) (* (- 1) |ULTIMATE.start_cstrncat_~s~0#1.offset|)))} call cstrncat_#t~mem2#1 := read~int(cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset, 1); {923#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrncat_~s~0#1.base|) (* (- 1) |ULTIMATE.start_cstrncat_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrncat_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrncat_~s~0#1.base|)))} is VALID [2022-02-21 04:35:06,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {923#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrncat_~s~0#1.base|) (* (- 1) |ULTIMATE.start_cstrncat_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrncat_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrncat_~s~0#1.base|)))} assume !!(0 != cstrncat_#t~mem2#1);havoc cstrncat_#t~mem2#1;cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post3#1.base, 1 + cstrncat_#t~post3#1.offset;havoc cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset; {885#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_cstrncat_~s~0#1.base|) (* (- 1) |ULTIMATE.start_cstrncat_~s~0#1.offset|)))))} is VALID [2022-02-21 04:35:06,437 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:06,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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:06,445 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:06,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 12 letters. Loop has 2 letters. [2022-02-21 04:35:06,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,445 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:35:06,445 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 43 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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:06,486 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 43 transitions. cyclomatic complexity: 17. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 45 states and 64 transitions. Complement of second has 6 states. [2022-02-21 04:35:06,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:06,487 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:06,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 43 transitions. cyclomatic complexity: 17 [2022-02-21 04:35:06,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:06,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:06,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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:06,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:06,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:06,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:06,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 64 transitions. [2022-02-21 04:35:06,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:06,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:06,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:06,491 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 43 transitions. cyclomatic complexity: 17 [2022-02-21 04:35:06,491 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 04:35:06,491 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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:06,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:06,492 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:06,492 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 64 transitions. cyclomatic complexity: 25 [2022-02-21 04:35:06,495 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:35:06,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:06,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 12 letters. Loop has 2 letters. [2022-02-21 04:35:06,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:06,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:06,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 1 letters. Loop has 2 letters. [2022-02-21 04:35:06,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:06,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 17 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:06,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 3 letters. [2022-02-21 04:35:06,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:06,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 17 Stem has 45 letters. Loop has 45 letters. [2022-02-21 04:35:06,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 45 letters. Loop has 45 letters. [2022-02-21 04:35:06,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 25 Stem has 45 letters. Loop has 45 letters. [2022-02-21 04:35:06,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 17 Stem has 31 letters. Loop has 31 letters. [2022-02-21 04:35:06,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 31 letters. Loop has 31 letters. [2022-02-21 04:35:06,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 25 Stem has 31 letters. Loop has 31 letters. [2022-02-21 04:35:06,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:06,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 4 letters. Loop has 4 letters. [2022-02-21 04:35:06,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 25 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:06,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:06,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 13 letters. Loop has 3 letters. [2022-02-21 04:35:06,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 25 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:06,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:06,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 3 letters. [2022-02-21 04:35:06,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 25 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:06,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:06,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 12 letters. Loop has 3 letters. [2022-02-21 04:35:06,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:06,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:06,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 13 letters. Loop has 2 letters. [2022-02-21 04:35:06,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 25 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:06,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:06,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 12 letters. Loop has 2 letters. [2022-02-21 04:35:06,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:06,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:06,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 1 letters. Loop has 2 letters. [2022-02-21 04:35:06,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:06,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 17 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:06,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 3 letters. [2022-02-21 04:35:06,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:06,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 17 Stem has 18 letters. Loop has 3 letters. [2022-02-21 04:35:06,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 18 letters. Loop has 3 letters. [2022-02-21 04:35:06,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 3 letters. [2022-02-21 04:35:06,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 43 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 3 letters. [2022-02-21 04:35:06,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 19 letters. Loop has 3 letters. [2022-02-21 04:35:06,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 25 Stem has 19 letters. Loop has 3 letters. [2022-02-21 04:35:06,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,510 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:06,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-02-21 04:35:06,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:06,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 14 letters. Loop has 2 letters. [2022-02-21 04:35:06,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:35:06,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 64 transitions. cyclomatic complexity: 25 [2022-02-21 04:35:06,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:06,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 40 states and 54 transitions. [2022-02-21 04:35:06,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-02-21 04:35:06,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-02-21 04:35:06,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 54 transitions. [2022-02-21 04:35:06,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:35:06,516 INFO L681 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2022-02-21 04:35:06,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 54 transitions. [2022-02-21 04:35:06,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-02-21 04:35:06,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:06,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states and 54 transitions. Second operand has 39 states, 39 states have (on average 1.358974358974359) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 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:06,521 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states and 54 transitions. Second operand has 39 states, 39 states have (on average 1.358974358974359) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 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:06,521 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. Second operand has 39 states, 39 states have (on average 1.358974358974359) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 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:06,521 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:06,526 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-02-21 04:35:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2022-02-21 04:35:06,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:06,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:06,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 39 states have (on average 1.358974358974359) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 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 40 states and 54 transitions. [2022-02-21 04:35:06,527 INFO L87 Difference]: Start difference. First operand has 39 states, 39 states have (on average 1.358974358974359) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 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 40 states and 54 transitions. [2022-02-21 04:35:06,528 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:06,531 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-02-21 04:35:06,531 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2022-02-21 04:35:06,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:06,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:06,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:06,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:06,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.358974358974359) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 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:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-02-21 04:35:06,533 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2022-02-21 04:35:06,533 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2022-02-21 04:35:06,533 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:35:06,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2022-02-21 04:35:06,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:06,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:06,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:06,534 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:06,534 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:06,534 INFO L791 eck$LassoCheckResult]: Stem: 988#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 989#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 1002#L531 assume !(main_~length1~0#1 < 1); 1003#L531-2 assume main_~length2~0#1 < 1;main_~length2~0#1 := 1; 981#L534-1 assume !(main_~n~0#1 < 1); 982#L537-1 assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 983#L544-3 assume !(main_~i~0#1 < main_~length1~0#1 - main_~n~0#1 - 1); 985#L544-4 main_~i~1#1 := 0; 990#L549-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 991#L549-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - main_~n~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrncat } true;cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset, cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset, cstrncat_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~0#1;havoc cstrncat_#res#1.base, cstrncat_#res#1.offset;havoc cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset, cstrncat_#t~mem2#1, cstrncat_#t~post7#1, cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset, cstrncat_#t~post4#1.base, cstrncat_#t~post4#1.offset, cstrncat_#t~mem5#1, cstrncat_#t~short6#1, cstrncat_#t~mem9#1, cstrncat_~s1#1.base, cstrncat_~s1#1.offset, cstrncat_~s2#1.base, cstrncat_~s2#1.offset, cstrncat_~n#1, cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s1#1.base, cstrncat_~s1#1.offset := cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset;cstrncat_~s2#1.base, cstrncat_~s2#1.offset := cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset;cstrncat_~n#1 := cstrncat_#in~n#1;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_~s1#1.base, cstrncat_~s1#1.offset; 995#L517-3 call cstrncat_#t~mem2#1 := read~int(cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset, 1); 1000#L517-1 assume !(0 != cstrncat_#t~mem2#1);havoc cstrncat_#t~mem2#1; 1001#L519-4 cstrncat_#t~short6#1 := 0 != cstrncat_~n#1; 1006#L519 assume !cstrncat_#t~short6#1; 1009#L519-2 assume !!cstrncat_#t~short6#1;havoc cstrncat_#t~post4#1.base, cstrncat_#t~post4#1.offset;havoc cstrncat_#t~mem5#1;havoc cstrncat_#t~short6#1;cstrncat_#t~post7#1 := cstrncat_~n#1;cstrncat_~n#1 := cstrncat_#t~post7#1 - 1;havoc cstrncat_#t~post7#1;cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post8#1.base, 1 + cstrncat_#t~post8#1.offset;havoc cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset; 1018#L519-4 cstrncat_#t~short6#1 := 0 != cstrncat_~n#1; 1005#L519 [2022-02-21 04:35:06,534 INFO L793 eck$LassoCheckResult]: Loop: 1005#L519 assume !cstrncat_#t~short6#1; 996#L519-2 assume !!cstrncat_#t~short6#1;havoc cstrncat_#t~post4#1.base, cstrncat_#t~post4#1.offset;havoc cstrncat_#t~mem5#1;havoc cstrncat_#t~short6#1;cstrncat_#t~post7#1 := cstrncat_~n#1;cstrncat_~n#1 := cstrncat_#t~post7#1 - 1;havoc cstrncat_#t~post7#1;cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post8#1.base, 1 + cstrncat_#t~post8#1.offset;havoc cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset; 997#L519-4 cstrncat_#t~short6#1 := 0 != cstrncat_~n#1; 1005#L519 [2022-02-21 04:35:06,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:06,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1436393274, now seen corresponding path program 1 times [2022-02-21 04:35:06,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:06,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570314109] [2022-02-21 04:35:06,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:06,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:06,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {1247#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1247#true} is VALID [2022-02-21 04:35:06,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {1247#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {1247#true} is VALID [2022-02-21 04:35:06,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {1247#true} assume !(main_~length1~0#1 < 1); {1247#true} is VALID [2022-02-21 04:35:06,569 INFO L290 TraceCheckUtils]: 3: Hoare triple {1247#true} assume main_~length2~0#1 < 1;main_~length2~0#1 := 1; {1247#true} is VALID [2022-02-21 04:35:06,570 INFO L290 TraceCheckUtils]: 4: Hoare triple {1247#true} assume !(main_~n~0#1 < 1); {1247#true} is VALID [2022-02-21 04:35:06,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {1247#true} assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {1247#true} is VALID [2022-02-21 04:35:06,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {1247#true} assume !(main_~i~0#1 < main_~length1~0#1 - main_~n~0#1 - 1); {1247#true} is VALID [2022-02-21 04:35:06,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {1247#true} main_~i~1#1 := 0; {1247#true} is VALID [2022-02-21 04:35:06,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {1247#true} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {1247#true} is VALID [2022-02-21 04:35:06,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {1247#true} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - main_~n~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrncat } true;cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset, cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset, cstrncat_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~0#1;havoc cstrncat_#res#1.base, cstrncat_#res#1.offset;havoc cstrncat_#t~post3#1.base, cstrncat_#t~post3#1.offset, cstrncat_#t~mem2#1, cstrncat_#t~post7#1, cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset, cstrncat_#t~post4#1.base, cstrncat_#t~post4#1.offset, cstrncat_#t~mem5#1, cstrncat_#t~short6#1, cstrncat_#t~mem9#1, cstrncat_~s1#1.base, cstrncat_~s1#1.offset, cstrncat_~s2#1.base, cstrncat_~s2#1.offset, cstrncat_~n#1, cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s1#1.base, cstrncat_~s1#1.offset := cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset;cstrncat_~s2#1.base, cstrncat_~s2#1.offset := cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset;cstrncat_~n#1 := cstrncat_#in~n#1;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_~s1#1.base, cstrncat_~s1#1.offset; {1247#true} is VALID [2022-02-21 04:35:06,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {1247#true} call cstrncat_#t~mem2#1 := read~int(cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset, 1); {1247#true} is VALID [2022-02-21 04:35:06,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {1247#true} assume !(0 != cstrncat_#t~mem2#1);havoc cstrncat_#t~mem2#1; {1247#true} is VALID [2022-02-21 04:35:06,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {1247#true} cstrncat_#t~short6#1 := 0 != cstrncat_~n#1; {1247#true} is VALID [2022-02-21 04:35:06,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {1247#true} assume !cstrncat_#t~short6#1; {1249#(not |ULTIMATE.start_cstrncat_#t~short6#1|)} is VALID [2022-02-21 04:35:06,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {1249#(not |ULTIMATE.start_cstrncat_#t~short6#1|)} assume !!cstrncat_#t~short6#1;havoc cstrncat_#t~post4#1.base, cstrncat_#t~post4#1.offset;havoc cstrncat_#t~mem5#1;havoc cstrncat_#t~short6#1;cstrncat_#t~post7#1 := cstrncat_~n#1;cstrncat_~n#1 := cstrncat_#t~post7#1 - 1;havoc cstrncat_#t~post7#1;cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post8#1.base, 1 + cstrncat_#t~post8#1.offset;havoc cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset; {1248#false} is VALID [2022-02-21 04:35:06,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {1248#false} cstrncat_#t~short6#1 := 0 != cstrncat_~n#1; {1248#false} is VALID [2022-02-21 04:35:06,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:06,573 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:06,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570314109] [2022-02-21 04:35:06,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570314109] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:06,573 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:06,573 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:35:06,573 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076552276] [2022-02-21 04:35:06,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:06,574 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:35:06,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:06,575 INFO L85 PathProgramCache]: Analyzing trace with hash 104447, now seen corresponding path program 1 times [2022-02-21 04:35:06,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:06,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739074350] [2022-02-21 04:35:06,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:06,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:06,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {1250#true} assume !cstrncat_#t~short6#1; {1252#(not |ULTIMATE.start_cstrncat_#t~short6#1|)} is VALID [2022-02-21 04:35:06,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {1252#(not |ULTIMATE.start_cstrncat_#t~short6#1|)} assume !!cstrncat_#t~short6#1;havoc cstrncat_#t~post4#1.base, cstrncat_#t~post4#1.offset;havoc cstrncat_#t~mem5#1;havoc cstrncat_#t~short6#1;cstrncat_#t~post7#1 := cstrncat_~n#1;cstrncat_~n#1 := cstrncat_#t~post7#1 - 1;havoc cstrncat_#t~post7#1;cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post8#1.base, 1 + cstrncat_#t~post8#1.offset;havoc cstrncat_#t~post8#1.base, cstrncat_#t~post8#1.offset; {1251#false} is VALID [2022-02-21 04:35:06,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {1251#false} cstrncat_#t~short6#1 := 0 != cstrncat_~n#1; {1251#false} is VALID [2022-02-21 04:35:06,584 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:06,584 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:06,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739074350] [2022-02-21 04:35:06,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739074350] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:06,585 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:06,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 04:35:06,587 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201630430] [2022-02-21 04:35:06,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:06,587 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:35:06,587 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:06,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:35:06,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:35:06,588 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. cyclomatic complexity: 20 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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:06,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:06,612 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2022-02-21 04:35:06,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:35:06,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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:06,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:06,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 49 transitions. [2022-02-21 04:35:06,615 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:06,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 0 states and 0 transitions. [2022-02-21 04:35:06,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:35:06,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:35:06,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:35:06,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:06,615 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:06,615 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:06,615 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:06,615 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 04:35:06,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:35:06,616 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:06,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:06,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:35:06 BoogieIcfgContainer [2022-02-21 04:35:06,620 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:35:06,620 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:35:06,620 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:35:06,621 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:35:06,621 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:58" (3/4) ... [2022-02-21 04:35:06,622 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:35:06,622 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:35:06,623 INFO L158 Benchmark]: Toolchain (without parser) took 9044.93ms. Allocated memory was 125.8MB in the beginning and 197.1MB in the end (delta: 71.3MB). Free memory was 97.6MB in the beginning and 75.4MB in the end (delta: 22.2MB). Peak memory consumption was 93.2MB. Max. memory is 16.1GB. [2022-02-21 04:35:06,623 INFO L158 Benchmark]: CDTParser took 3.78ms. Allocated memory is still 125.8MB. Free memory was 80.1MB in the beginning and 80.1MB in the end (delta: 68.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:06,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.21ms. Allocated memory is still 125.8MB. Free memory was 97.4MB in the beginning and 90.8MB in the end (delta: 6.6MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2022-02-21 04:35:06,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.51ms. Allocated memory is still 125.8MB. Free memory was 90.8MB in the beginning and 88.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:06,624 INFO L158 Benchmark]: Boogie Preprocessor took 51.07ms. Allocated memory is still 125.8MB. Free memory was 88.5MB in the beginning and 86.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:06,624 INFO L158 Benchmark]: RCFGBuilder took 419.27ms. Allocated memory is still 125.8MB. Free memory was 86.9MB in the beginning and 71.6MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-21 04:35:06,624 INFO L158 Benchmark]: BuchiAutomizer took 8136.66ms. Allocated memory was 125.8MB in the beginning and 197.1MB in the end (delta: 71.3MB). Free memory was 71.4MB in the beginning and 75.4MB in the end (delta: -4.0MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. [2022-02-21 04:35:06,624 INFO L158 Benchmark]: Witness Printer took 2.06ms. Allocated memory is still 197.1MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:06,625 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 3.78ms. Allocated memory is still 125.8MB. Free memory was 80.1MB in the beginning and 80.1MB in the end (delta: 68.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.21ms. Allocated memory is still 125.8MB. Free memory was 97.4MB in the beginning and 90.8MB in the end (delta: 6.6MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.51ms. Allocated memory is still 125.8MB. Free memory was 90.8MB in the beginning and 88.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.07ms. Allocated memory is still 125.8MB. Free memory was 88.5MB in the beginning and 86.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 419.27ms. Allocated memory is still 125.8MB. Free memory was 86.9MB in the beginning and 71.6MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 8136.66ms. Allocated memory was 125.8MB in the beginning and 197.1MB in the end (delta: 71.3MB). Free memory was 71.4MB in the beginning and 75.4MB in the end (delta: -4.0MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. * Witness Printer took 2.06ms. Allocated memory is still 197.1MB. Free memory is still 75.4MB. 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 -1 * i + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * nondetString1 and consists of 5 locations. One deterministic module has affine ranking function length2 + -1 * i and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.1s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 1. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 25 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 156 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 268 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 128 IncrementalHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 122 mSDtfsCounter, 128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI1 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital169 mio100 ax111 hnf100 lsp84 ukn83 mio100 lsp59 div100 bol100 ite100 ukn100 eq170 hnf90 smp98 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 3 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:06,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-02-21 04:35:06,863 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