./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.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/cstrcspn-alloca-1.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 15fe42cb945ebd9019cc38134c29264613097f232589ff55d01d33d66b19d85f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:34:51,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:34:51,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:34:51,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:34:51,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:34:51,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:34:51,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:34:51,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:34:51,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:34:51,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:34:51,937 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:34:51,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:34:51,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:34:51,941 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:34:51,942 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:34:51,943 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:34:51,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:34:51,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:34:51,948 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:34:51,951 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:34:51,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:34:51,956 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:34:51,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:34:51,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:34:51,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:34:51,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:34:51,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:34:51,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:34:51,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:34:51,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:34:51,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:34:51,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:34:51,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:34:51,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:34:51,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:34:51,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:34:51,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:34:51,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:34:51,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:34:51,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:34:51,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:34:51,972 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:51,992 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:34:51,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:34:51,993 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:34:51,993 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:34:51,994 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:34:51,994 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:34:51,995 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:34:51,995 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:34:51,995 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:34:51,995 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:34:51,996 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:34:51,996 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:34:51,996 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:34:51,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:34:51,996 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:34:51,996 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:34:51,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:34:51,997 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:34:51,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:34:51,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:34:51,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:34:51,997 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:34:51,997 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:34:51,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:34:51,998 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:34:51,998 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:34:51,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:34:51,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:34:51,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:34:51,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:34:51,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:34:52,000 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:34:52,000 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 -> 15fe42cb945ebd9019cc38134c29264613097f232589ff55d01d33d66b19d85f [2022-02-21 04:34:52,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:34:52,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:34:52,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:34:52,208 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:34:52,208 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:34:52,209 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i [2022-02-21 04:34:52,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8bea0b26/65d5cff16834497d80c55278c2fcf05c/FLAG2ee4e3146 [2022-02-21 04:34:52,686 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:34:52,689 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i [2022-02-21 04:34:52,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8bea0b26/65d5cff16834497d80c55278c2fcf05c/FLAG2ee4e3146 [2022-02-21 04:34:52,717 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8bea0b26/65d5cff16834497d80c55278c2fcf05c [2022-02-21 04:34:52,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:34:52,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:34:52,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:34:52,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:34:52,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:34:52,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:34:52" (1/1) ... [2022-02-21 04:34:52,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dfde3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:52, skipping insertion in model container [2022-02-21 04:34:52,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:34:52" (1/1) ... [2022-02-21 04:34:52,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:34:52,766 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:34:53,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:34:53,017 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:34:53,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:34:53,084 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:34:53,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:53 WrapperNode [2022-02-21 04:34:53,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:34:53,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:34:53,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:34:53,087 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:34:53,091 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:53" (1/1) ... [2022-02-21 04:34:53,116 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:53" (1/1) ... [2022-02-21 04:34:53,143 INFO L137 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2022-02-21 04:34:53,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:34:53,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:34:53,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:34:53,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:34:53,150 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:53" (1/1) ... [2022-02-21 04:34:53,151 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:53" (1/1) ... [2022-02-21 04:34:53,157 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:53" (1/1) ... [2022-02-21 04:34:53,157 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:53" (1/1) ... [2022-02-21 04:34:53,169 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:53" (1/1) ... [2022-02-21 04:34:53,171 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:53" (1/1) ... [2022-02-21 04:34:53,173 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:53" (1/1) ... [2022-02-21 04:34:53,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:34:53,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:34:53,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:34:53,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:34:53,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:53" (1/1) ... [2022-02-21 04:34:53,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:53,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:53,210 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:53,212 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:53,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:34:53,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:34:53,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:34:53,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:34:53,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:34:53,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:34:53,358 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:34:53,359 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:34:53,602 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:34:53,606 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:34:53,606 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-21 04:34:53,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:34:53 BoogieIcfgContainer [2022-02-21 04:34:53,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:34:53,609 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:34:53,609 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:34:53,613 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:34:53,614 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:53,614 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:34:52" (1/3) ... [2022-02-21 04:34:53,615 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@877b597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:34:53, skipping insertion in model container [2022-02-21 04:34:53,615 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:53,616 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:53" (2/3) ... [2022-02-21 04:34:53,630 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@877b597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:34:53, skipping insertion in model container [2022-02-21 04:34:53,630 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:53,630 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:34:53" (3/3) ... [2022-02-21 04:34:53,631 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrcspn-alloca-1.i [2022-02-21 04:34:53,682 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:34:53,682 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:34:53,682 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:34:53,682 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:34:53,683 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:34:53,683 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:34:53,683 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:34:53,683 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:34:53,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:53,713 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 04:34:53,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:53,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:53,718 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:34:53,718 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:53,718 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:34:53,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:53,725 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 04:34:53,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:53,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:53,726 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:34:53,726 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:53,731 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 11#L532true assume !(main_~length1~0#1 < 1); 7#L532-2true assume !(main_~length2~0#1 < 1); 3#L535-1true call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 18#L541-3true [2022-02-21 04:34:53,731 INFO L793 eck$LassoCheckResult]: Loop: 18#L541-3true assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 24#L541-2true main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 18#L541-3true [2022-02-21 04:34:53,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:53,735 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 04:34:53,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:53,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359717811] [2022-02-21 04:34:53,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:53,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:53,824 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:53,863 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:53,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:53,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-02-21 04:34:53,867 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:53,867 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839341994] [2022-02-21 04:34:53,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:53,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:53,888 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:53,906 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:53,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:53,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-02-21 04:34:53,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:53,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10131924] [2022-02-21 04:34:53,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:53,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:53,949 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:53,979 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:54,311 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:34:54,311 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:34:54,311 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:34:54,311 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:34:54,312 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:34:54,312 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,312 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:34:54,312 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:34:54,312 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration1_Lasso [2022-02-21 04:34:54,312 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:34:54,312 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:34:54,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:54,329 INFO L141 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:54,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:54,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:54,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:54,526 INFO L141 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:54,528 INFO L141 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:54,530 INFO L141 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:54,532 INFO L141 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:54,534 INFO L141 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:54,537 INFO L141 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:54,538 INFO L141 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:54,541 INFO L141 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:54,543 INFO L141 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:54,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:54,858 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:34:54,861 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:34:54,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,864 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:54,869 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:54,875 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:54,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:54,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:54,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:54,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:54,896 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:54,912 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:54,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,915 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:54,915 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:54,917 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:54,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:54,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:54,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:54,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:54,951 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:54,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,953 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:54,954 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:54,955 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:54,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:54,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:54,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:54,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:54,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 04:34:54,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:54,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:54,991 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:54,992 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:54,993 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:54,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:54,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:54,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:54,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:55,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:55,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:55,026 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:34:55,045 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-02-21 04:34:55,045 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-02-21 04:34:55,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:55,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:55,115 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:55,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:34:55,140 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:34:55,155 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:34:55,155 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:34:55,156 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nondetString1~0#1.offset, v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~nondetString1~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 04:34:55,175 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:55,213 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 04:34:55,218 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1;" "main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2022-02-21 04:34:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:55,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:55,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:34:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:55,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:55,306 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:34:55,306 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~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {34#unseeded} is VALID [2022-02-21 04:34:55,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#unseeded} assume !(main_~length1~0#1 < 1); {34#unseeded} is VALID [2022-02-21 04:34:55,307 INFO L290 TraceCheckUtils]: 3: Hoare triple {34#unseeded} assume !(main_~length2~0#1 < 1); {34#unseeded} is VALID [2022-02-21 04:34:55,308 INFO L290 TraceCheckUtils]: 4: Hoare triple {34#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {34#unseeded} is VALID [2022-02-21 04:34:55,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:55,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:34:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:55,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:55,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|)))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {94#(and (<= (+ |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|) (* (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} is VALID [2022-02-21 04:34:55,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {94#(and (<= (+ |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|) (* (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {77#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|)))))} is VALID [2022-02-21 04:34:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:55,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:55,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:55,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:55,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,389 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:34:55,390 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:55,526 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 87 transitions. Complement of second has 7 states. [2022-02-21 04:34:55,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:34:55,526 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:55,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 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:55,531 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 04:34:55,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:55,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:55,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:55,538 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:34:55,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:55,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:55,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 87 transitions. [2022-02-21 04:34:55,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-02-21 04:34:55,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:55,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:55,544 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 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:55,548 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 04:34:55,553 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 04:34:55,553 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:55,554 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:34:55,555 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:34:55,555 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 60 states and 87 transitions. cyclomatic complexity: 34 [2022-02-21 04:34:55,560 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 04:34:55,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:55,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:55,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:55,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:55,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:55,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:55,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:55,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:55,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:55,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 60 letters. [2022-02-21 04:34:55,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 60 letters. [2022-02-21 04:34:55,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 60 letters. Loop has 60 letters. [2022-02-21 04:34:55,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 24 letters. [2022-02-21 04:34:55,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 24 letters. [2022-02-21 04:34:55,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 24 letters. [2022-02-21 04:34:55,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:34:55,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:34:55,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:34:55,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 6 letters. [2022-02-21 04:34:55,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 6 letters. [2022-02-21 04:34:55,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 12 letters. Loop has 6 letters. [2022-02-21 04:34:55,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 6 letters. [2022-02-21 04:34:55,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 6 letters. [2022-02-21 04:34:55,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 6 letters. [2022-02-21 04:34:55,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 6 letters. [2022-02-21 04:34:55,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 6 letters. [2022-02-21 04:34:55,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 14 letters. Loop has 6 letters. [2022-02-21 04:34:55,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 6 letters. [2022-02-21 04:34:55,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 6 letters. [2022-02-21 04:34:55,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 13 letters. Loop has 6 letters. [2022-02-21 04:34:55,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:34:55,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:34:55,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:34:55,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:34:55,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:34:55,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:34:55,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 6 letters. [2022-02-21 04:34:55,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 6 letters. [2022-02-21 04:34:55,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 6 letters. [2022-02-21 04:34:55,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:34:55,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:34:55,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:34:55,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:55,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:55,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:55,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:55,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:55,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:55,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:34:55,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:34:55,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:34:55,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:55,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:55,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:55,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:34:55,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:34:55,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:34:55,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:55,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:55,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:55,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 8 letters. [2022-02-21 04:34:55,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 8 letters. [2022-02-21 04:34:55,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 14 letters. Loop has 8 letters. [2022-02-21 04:34:55,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 8 letters. [2022-02-21 04:34:55,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:34:55,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:34:55,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:34:55,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:34:55,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:34:55,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 8 letters. [2022-02-21 04:34:55,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 8 letters. [2022-02-21 04:34:55,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 8 letters. [2022-02-21 04:34:55,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:34:55,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:34:55,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:34:55,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 8 letters. [2022-02-21 04:34:55,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 8 letters. [2022-02-21 04:34:55,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 8 letters. [2022-02-21 04:34:55,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:34:55,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:34:55,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:34:55,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:34:55,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:34:55,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:34:55,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:55,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:55,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:55,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:55,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:55,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:55,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,594 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:55,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-02-21 04:34:55,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:55,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:55,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:34:55,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:55,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 87 transitions. cyclomatic complexity: 34 [2022-02-21 04:34:55,601 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-02-21 04:34:55,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 20 states and 27 transitions. [2022-02-21 04:34:55,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-02-21 04:34:55,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-02-21 04:34:55,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2022-02-21 04:34:55,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:55,605 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-02-21 04:34:55,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2022-02-21 04:34:55,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-21 04:34:55,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:55,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 27 transitions. Second operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:55,621 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 27 transitions. Second operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:55,623 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:55,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:55,625 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-02-21 04:34:55,626 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2022-02-21 04:34:55,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:55,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:55,626 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states and 27 transitions. [2022-02-21 04:34:55,627 INFO L87 Difference]: Start difference. First operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states and 27 transitions. [2022-02-21 04:34:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:55,628 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-02-21 04:34:55,628 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2022-02-21 04:34:55,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:55,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:55,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:55,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:55,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2022-02-21 04:34:55,630 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-02-21 04:34:55,630 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-02-21 04:34:55,630 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:34:55,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2022-02-21 04:34:55,630 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-02-21 04:34:55,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:55,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:55,631 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:34:55,631 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:55,631 INFO L791 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 171#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 177#L532 assume !(main_~length1~0#1 < 1); 174#L532-2 assume !(main_~length2~0#1 < 1); 168#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 169#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 178#L541-4 main_~i~1#1 := 0; 173#L547-3 [2022-02-21 04:34:55,631 INFO L793 eck$LassoCheckResult]: Loop: 173#L547-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 172#L547-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 173#L547-3 [2022-02-21 04:34:55,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:55,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2022-02-21 04:34:55,632 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:55,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862226003] [2022-02-21 04:34:55,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:55,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:55,641 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:55,648 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:55,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:55,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2022-02-21 04:34:55,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:55,649 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280783082] [2022-02-21 04:34:55,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:55,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:55,654 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:55,657 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:55,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:55,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2022-02-21 04:34:55,658 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:55,658 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210350622] [2022-02-21 04:34:55,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:55,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:55,670 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:55,678 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:55,906 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:34:55,906 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:34:55,906 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:34:55,906 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:34:55,906 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:34:55,907 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:55,907 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:34:55,907 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:34:55,907 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration2_Lasso [2022-02-21 04:34:55,907 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:34:55,907 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:34:55,908 INFO L141 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:55,910 INFO L141 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:55,912 INFO L141 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:55,915 INFO L141 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:55,918 INFO L141 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:55,919 INFO L141 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:55,921 INFO L141 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:55,923 INFO L141 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:55,929 INFO L141 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:55,931 INFO L141 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:55,933 INFO L141 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:55,935 INFO L141 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:55,938 INFO L141 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:56,081 INFO L141 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:56,371 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:34:56,371 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:34:56,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:56,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:56,374 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:56,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:34:56,377 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:56,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:56,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:56,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:56,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:56,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:56,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:56,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:56,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:56,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:56,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:56,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:56,419 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:56,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:34:56,423 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:56,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:56,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:56,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:56,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:56,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:56,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:56,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:56,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:56,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:56,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:56,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:56,458 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:56,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:34:56,460 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:56,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:56,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:56,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:56,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:56,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:56,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:56,483 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:56,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:56,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:56,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:56,500 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:56,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:34:56,502 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:56,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:56,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:56,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:56,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:56,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:56,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:56,524 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:56,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:56,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:56,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:56,552 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:56,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 04:34:56,557 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:56,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:56,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:56,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:56,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:56,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:56,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:56,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:56,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:56,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:56,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:56,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:56,596 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:56,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 04:34:56,599 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:56,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:56,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:56,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:56,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:56,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:56,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:56,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:56,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 04:34:56,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:56,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:56,638 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:56,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 04:34:56,640 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:56,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:56,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:56,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:56,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:56,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:56,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:56,660 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:56,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:56,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:56,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:56,677 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:56,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:34:56,679 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:56,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:56,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:56,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:56,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:56,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:56,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:56,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:56,686 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:56,703 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:34:56,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:56,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:56,704 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:56,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:34:56,708 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:56,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:56,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:56,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:56,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:56,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:56,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:56,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:56,731 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:56,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:56,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:56,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:56,752 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:56,762 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:56,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:56,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:56,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:56,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:56,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:56,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:56,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:56,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:34:56,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:56,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:56,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:56,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:56,800 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:56,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:34:56,803 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:56,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:56,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:56,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:56,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:56,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:56,810 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:56,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:56,810 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:56,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:56,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:56,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:56,829 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:56,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:34:56,832 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:56,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:56,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:56,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:56,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:56,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:56,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:56,853 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:56,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:56,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:56,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:56,872 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:56,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:34:56,875 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:56,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:56,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:56,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:56,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:56,894 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:56,894 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:56,907 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:34:56,919 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-02-21 04:34:56,919 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-02-21 04:34:56,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:56,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:56,924 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:56,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:34:56,928 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:34:56,960 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:34:56,960 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:34:56,960 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:34:56,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:56,997 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 04:34:57,001 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1;" "main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1;" [2022-02-21 04:34:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:57,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:57,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:34:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:57,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:57,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {237#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {237#unseeded} is VALID [2022-02-21 04:34:57,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {237#unseeded} is VALID [2022-02-21 04:34:57,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {237#unseeded} assume !(main_~length1~0#1 < 1); {237#unseeded} is VALID [2022-02-21 04:34:57,046 INFO L290 TraceCheckUtils]: 3: Hoare triple {237#unseeded} assume !(main_~length2~0#1 < 1); {237#unseeded} is VALID [2022-02-21 04:34:57,046 INFO L290 TraceCheckUtils]: 4: Hoare triple {237#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {237#unseeded} is VALID [2022-02-21 04:34:57,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {237#unseeded} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {237#unseeded} is VALID [2022-02-21 04:34:57,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {237#unseeded} main_~i~1#1 := 0; {237#unseeded} is VALID [2022-02-21 04:34:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:57,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:34:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:57,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:57,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#(>= oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|)))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; {303#(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:34:57,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {303#(and (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length2~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|))))} main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {280#(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:34:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:57,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:57,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:57,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:57,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,082 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:34:57,082 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:57,135 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 44 transitions. Complement of second has 6 states. [2022-02-21 04:34:57,136 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:34:57,136 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:57,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. cyclomatic complexity: 10 [2022-02-21 04:34:57,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:57,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:57,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:57,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:34:57,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:57,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:57,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2022-02-21 04:34:57,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 04:34:57,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:57,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:57,138 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 27 transitions. cyclomatic complexity: 10 [2022-02-21 04:34:57,139 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 04:34:57,139 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:57,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:34:57,139 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:34:57,140 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 44 transitions. cyclomatic complexity: 17 [2022-02-21 04:34:57,140 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 04:34:57,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:57,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:57,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:57,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:57,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:57,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:57,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:34:57,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:34:57,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:34:57,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 31 letters. Loop has 31 letters. [2022-02-21 04:34:57,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 31 letters. [2022-02-21 04:34:57,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 31 letters. Loop has 31 letters. [2022-02-21 04:34:57,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 20 letters. [2022-02-21 04:34:57,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 20 letters. [2022-02-21 04:34:57,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 20 letters. Loop has 20 letters. [2022-02-21 04:34:57,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:34:57,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:34:57,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:34:57,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 8 letters. [2022-02-21 04:34:57,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 8 letters. [2022-02-21 04:34:57,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 15 letters. Loop has 8 letters. [2022-02-21 04:34:57,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:34:57,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:34:57,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:34:57,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:34:57,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:34:57,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:34:57,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:34:57,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:34:57,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:34:57,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:34:57,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:34:57,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:34:57,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 8 letters. [2022-02-21 04:34:57,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 8 letters. [2022-02-21 04:34:57,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 8 letters. [2022-02-21 04:34:57,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:34:57,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:34:57,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:34:57,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 8 letters. [2022-02-21 04:34:57,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 8 letters. [2022-02-21 04:34:57,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 8 letters. [2022-02-21 04:34:57,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:57,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:57,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:57,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:57,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:57,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:57,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:57,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:57,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:57,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:34:57,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:34:57,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:34:57,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:34:57,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:34:57,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:34:57,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:34:57,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:34:57,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:34:57,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 8 letters. [2022-02-21 04:34:57,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 8 letters. [2022-02-21 04:34:57,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 8 letters. [2022-02-21 04:34:57,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 8 letters. [2022-02-21 04:34:57,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 8 letters. [2022-02-21 04:34:57,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 15 letters. Loop has 8 letters. [2022-02-21 04:34:57,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:34:57,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:34:57,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:34:57,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:34:57,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:34:57,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:34:57,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 8 letters. [2022-02-21 04:34:57,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 8 letters. [2022-02-21 04:34:57,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 8 letters. [2022-02-21 04:34:57,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,158 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:57,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:57,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-02-21 04:34:57,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:57,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:34:57,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:34:57,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 44 transitions. cyclomatic complexity: 17 [2022-02-21 04:34:57,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 04:34:57,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 29 transitions. [2022-02-21 04:34:57,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 04:34:57,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-02-21 04:34:57,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2022-02-21 04:34:57,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:57,166 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-02-21 04:34:57,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2022-02-21 04:34:57,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-21 04:34:57,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:57,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:57,168 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:57,168 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:57,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:57,169 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2022-02-21 04:34:57,170 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2022-02-21 04:34:57,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:57,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:57,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states and 29 transitions. [2022-02-21 04:34:57,170 INFO L87 Difference]: Start difference. First operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states and 29 transitions. [2022-02-21 04:34:57,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:57,171 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2022-02-21 04:34:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2022-02-21 04:34:57,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:57,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:57,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:57,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:57,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:57,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2022-02-21 04:34:57,174 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-02-21 04:34:57,174 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-02-21 04:34:57,174 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:34:57,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2022-02-21 04:34:57,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 04:34:57,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:57,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:57,175 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:34:57,176 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:34:57,176 INFO L791 eck$LassoCheckResult]: Stem: 351#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 352#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 356#L532 assume !(main_~length1~0#1 < 1); 353#L532-2 assume !(main_~length2~0#1 < 1); 347#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 348#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 357#L541-4 main_~i~1#1 := 0; 358#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 363#L547-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 362#L519-4 [2022-02-21 04:34:57,176 INFO L793 eck$LassoCheckResult]: Loop: 362#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 366#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 360#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 367#L522-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 359#L522-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 354#L522-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 355#L524 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 361#L519-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 362#L519-4 [2022-02-21 04:34:57,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:57,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2022-02-21 04:34:57,177 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:57,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364915067] [2022-02-21 04:34:57,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:57,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:57,194 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:57,204 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:57,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:57,207 INFO L85 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 1 times [2022-02-21 04:34:57,207 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:57,207 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066126848] [2022-02-21 04:34:57,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:57,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:57,218 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:57,230 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:57,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:57,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1903570310, now seen corresponding path program 1 times [2022-02-21 04:34:57,244 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:57,244 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13877298] [2022-02-21 04:34:57,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:57,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:57,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:57,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {417#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {417#true} is VALID [2022-02-21 04:34:57,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {417#true} is VALID [2022-02-21 04:34:57,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume !(main_~length1~0#1 < 1); {417#true} is VALID [2022-02-21 04:34:57,418 INFO L290 TraceCheckUtils]: 3: Hoare triple {417#true} assume !(main_~length2~0#1 < 1); {419#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} is VALID [2022-02-21 04:34:57,419 INFO L290 TraceCheckUtils]: 4: Hoare triple {419#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {420#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:34:57,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {420#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {420#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:34:57,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {420#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} main_~i~1#1 := 0; {421#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (= |ULTIMATE.start_main_~i~1#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:34:57,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {421#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (= |ULTIMATE.start_main_~i~1#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {422#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~length2~0#1| 1) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:34:57,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~length2~0#1| 1) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; {423#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 04:34:57,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {423#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {423#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 04:34:57,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {423#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; {424#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0)} is VALID [2022-02-21 04:34:57,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {424#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0)} call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; {425#(not |ULTIMATE.start_cstrcspn_#t~short7#1|)} is VALID [2022-02-21 04:34:57,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {425#(not |ULTIMATE.start_cstrcspn_#t~short7#1|)} assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); {418#false} is VALID [2022-02-21 04:34:57,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {418#false} assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; {418#false} is VALID [2022-02-21 04:34:57,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {418#false} call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); {418#false} is VALID [2022-02-21 04:34:57,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {418#false} assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; {418#false} is VALID [2022-02-21 04:34:57,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {418#false} cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; {418#false} is VALID [2022-02-21 04:34:57,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:57,425 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:34:57,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13877298] [2022-02-21 04:34:57,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13877298] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:34:57,426 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:34:57,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-21 04:34:57,426 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508777807] [2022-02-21 04:34:57,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:34:57,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:34:57,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 04:34:57,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-21 04:34:57,615 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:57,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:57,814 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-02-21 04:34:57,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 04:34:57,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:57,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:57,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2022-02-21 04:34:57,827 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-02-21 04:34:57,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 42 transitions. [2022-02-21 04:34:57,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-02-21 04:34:57,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-02-21 04:34:57,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2022-02-21 04:34:57,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:57,828 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-02-21 04:34:57,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2022-02-21 04:34:57,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-02-21 04:34:57,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:57,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 42 transitions. Second operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:57,830 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 42 transitions. Second operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:57,830 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:57,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:57,831 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-02-21 04:34:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-02-21 04:34:57,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:57,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:57,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 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 34 states and 42 transitions. [2022-02-21 04:34:57,831 INFO L87 Difference]: Start difference. First operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 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 34 states and 42 transitions. [2022-02-21 04:34:57,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:57,832 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-02-21 04:34:57,832 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-02-21 04:34:57,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:57,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:57,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:57,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:57,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-02-21 04:34:57,834 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-02-21 04:34:57,834 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-02-21 04:34:57,834 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:34:57,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2022-02-21 04:34:57,834 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-02-21 04:34:57,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:57,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:57,835 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:34:57,835 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:34:57,835 INFO L791 eck$LassoCheckResult]: Stem: 470#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 471#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 477#L532 assume !(main_~length1~0#1 < 1); 474#L532-2 assume !(main_~length2~0#1 < 1); 468#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 469#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 478#L541-4 main_~i~1#1 := 0; 479#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 483#L547-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 482#L519-4 [2022-02-21 04:34:57,835 INFO L793 eck$LassoCheckResult]: Loop: 482#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 496#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 495#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 489#L522-1 assume !cstrcspn_#t~short7#1; 480#L522-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 475#L522-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 476#L524 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 481#L519-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 482#L519-4 [2022-02-21 04:34:57,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:57,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 2 times [2022-02-21 04:34:57,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:57,836 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675038320] [2022-02-21 04:34:57,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:57,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:57,847 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:57,854 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:57,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:57,855 INFO L85 PathProgramCache]: Analyzing trace with hash -903038413, now seen corresponding path program 1 times [2022-02-21 04:34:57,855 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:57,855 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127100055] [2022-02-21 04:34:57,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:57,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:57,861 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:57,864 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:57,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:57,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1905417352, now seen corresponding path program 1 times [2022-02-21 04:34:57,865 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:57,865 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387099264] [2022-02-21 04:34:57,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:57,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:58,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {574#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {574#true} is VALID [2022-02-21 04:34:58,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {574#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {574#true} is VALID [2022-02-21 04:34:58,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {574#true} assume !(main_~length1~0#1 < 1); {576#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:34:58,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {576#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} assume !(main_~length2~0#1 < 1); {576#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:34:58,082 INFO L290 TraceCheckUtils]: 4: Hoare triple {576#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {577#(and (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (or (= |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~nondetString2~0#1.offset|) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} is VALID [2022-02-21 04:34:58,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {577#(and (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (or (= |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~nondetString2~0#1.offset|) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {578#(and (or (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (or (= |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~nondetString2~0#1.offset|) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} is VALID [2022-02-21 04:34:58,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {578#(and (or (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (or (= |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~nondetString2~0#1.offset|) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} main_~i~1#1 := 0; {578#(and (or (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (or (= |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~nondetString2~0#1.offset|) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} is VALID [2022-02-21 04:34:58,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {578#(and (or (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (or (= |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~nondetString2~0#1.offset|) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {578#(and (or (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (or (= |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~nondetString2~0#1.offset|) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} is VALID [2022-02-21 04:34:58,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {578#(and (or (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (or (= |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~nondetString2~0#1.offset|) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; {579#(or (and (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) 0))} is VALID [2022-02-21 04:34:58,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {579#(or (and (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) 0))} call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {580#(or (= |ULTIMATE.start_cstrcspn_#t~mem3#1| 0) (and (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (= |ULTIMATE.start_cstrcspn_#t~mem3#1| (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|)) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} is VALID [2022-02-21 04:34:58,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {580#(or (= |ULTIMATE.start_cstrcspn_#t~mem3#1| 0) (and (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (= |ULTIMATE.start_cstrcspn_#t~mem3#1| (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|)) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; {581#(and (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (not (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0)) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|))} is VALID [2022-02-21 04:34:58,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {581#(and (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (not (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0)) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|))} call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; {582#|ULTIMATE.start_cstrcspn_#t~short7#1|} is VALID [2022-02-21 04:34:58,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {582#|ULTIMATE.start_cstrcspn_#t~short7#1|} assume !cstrcspn_#t~short7#1; {575#false} is VALID [2022-02-21 04:34:58,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {575#false} assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; {575#false} is VALID [2022-02-21 04:34:58,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {575#false} call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); {575#false} is VALID [2022-02-21 04:34:58,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {575#false} assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; {575#false} is VALID [2022-02-21 04:34:58,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {575#false} cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; {575#false} is VALID [2022-02-21 04:34:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:58,088 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:34:58,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387099264] [2022-02-21 04:34:58,088 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387099264] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:34:58,089 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:34:58,089 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-21 04:34:58,089 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18474030] [2022-02-21 04:34:58,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:34:58,209 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:34:58,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 04:34:58,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-21 04:34:58,210 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:58,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:58,640 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-02-21 04:34:58,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 04:34:58,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:58,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:58,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 80 transitions. [2022-02-21 04:34:58,662 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2022-02-21 04:34:58,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 61 states and 75 transitions. [2022-02-21 04:34:58,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-02-21 04:34:58,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-02-21 04:34:58,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 75 transitions. [2022-02-21 04:34:58,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:58,664 INFO L681 BuchiCegarLoop]: Abstraction has 61 states and 75 transitions. [2022-02-21 04:34:58,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 75 transitions. [2022-02-21 04:34:58,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 40. [2022-02-21 04:34:58,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:58,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states and 75 transitions. Second operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 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,666 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states and 75 transitions. Second operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 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,667 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 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,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:58,668 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-02-21 04:34:58,668 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2022-02-21 04:34:58,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:58,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:58,669 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 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 61 states and 75 transitions. [2022-02-21 04:34:58,669 INFO L87 Difference]: Start difference. First operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 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 61 states and 75 transitions. [2022-02-21 04:34:58,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:58,670 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-02-21 04:34:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2022-02-21 04:34:58,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:58,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:58,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:58,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:58,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 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,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-02-21 04:34:58,671 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-02-21 04:34:58,671 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-02-21 04:34:58,672 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:34:58,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2022-02-21 04:34:58,672 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-02-21 04:34:58,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:58,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:58,672 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:34:58,672 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:34:58,673 INFO L791 eck$LassoCheckResult]: Stem: 663#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 664#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 670#L532 assume !(main_~length1~0#1 < 1); 667#L532-2 assume !(main_~length2~0#1 < 1); 661#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 662#L541-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 678#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 679#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 671#L541-4 main_~i~1#1 := 0; 672#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 690#L547-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 694#L519-4 [2022-02-21 04:34:58,673 INFO L793 eck$LassoCheckResult]: Loop: 694#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 693#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 692#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 685#L522-1 assume !cstrcspn_#t~short7#1; 686#L522-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 697#L522-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 696#L524 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 695#L519-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 694#L519-4 [2022-02-21 04:34:58,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:58,673 INFO L85 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2022-02-21 04:34:58,673 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:58,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411695094] [2022-02-21 04:34:58,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:58,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:58,686 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:58,694 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:58,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:58,694 INFO L85 PathProgramCache]: Analyzing trace with hash -903038413, now seen corresponding path program 2 times [2022-02-21 04:34:58,694 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:58,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207953113] [2022-02-21 04:34:58,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:58,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:58,700 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:58,703 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:58,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:58,704 INFO L85 PathProgramCache]: Analyzing trace with hash -162323734, now seen corresponding path program 1 times [2022-02-21 04:34:58,704 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:58,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873881577] [2022-02-21 04:34:58,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:58,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:58,719 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:58,728 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:59,430 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:34:59,430 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:34:59,430 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:34:59,430 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:34:59,430 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:34:59,430 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:59,430 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:34:59,431 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:34:59,431 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration5_Lasso [2022-02-21 04:34:59,431 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:34:59,431 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:34:59,433 INFO L141 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,444 INFO L141 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,446 INFO L141 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,448 INFO L141 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,924 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:34:59,926 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:34:59,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:34:59,942 INFO L141 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,944 INFO L141 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,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:34:59,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:34:59,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:34:59,952 INFO L141 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,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:34:59,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:34:59,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:34:59,960 INFO L141 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,961 INFO L141 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,963 INFO L141 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,964 INFO L141 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,966 INFO L141 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,968 INFO L141 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,972 INFO L141 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,973 INFO L141 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,978 INFO L141 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,980 INFO L141 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,982 INFO L141 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:00,560 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:00,560 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:00,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,562 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:00,563 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:00,564 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,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:00,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:00,574 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-02-21 04:35:00,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,591 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:00,592 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:00,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:00,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:00,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:00,601 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 04:35:00,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,618 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:00,619 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:00,619 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,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:00,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:00,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:00,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 04:35:00,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,643 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:00,644 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:00,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,654 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:00,654 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:00,658 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 04:35:00,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,675 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:00,675 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:00,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:00,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:00,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:00,684 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 04:35:00,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,700 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:00,704 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,707 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:00,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:00,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:00,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:00,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,726 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:00,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,728 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:00,728 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:00,729 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,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:00,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:00,750 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:00,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,767 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:00,768 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:00,769 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,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,776 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:00,776 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:00,778 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,793 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:00,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,794 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:00,796 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:00,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,804 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:00,804 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:00,806 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 04:35:00,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,822 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:00,823 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:00,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:00,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:00,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:00,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:00,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 04:35:00,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,879 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:00,879 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:00,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:00,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:00,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:00,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:00,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:00,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:00,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:00,923 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:00,950 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2022-02-21 04:35:00,951 INFO L444 ModelExtractionUtils]: 47 out of 61 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-02-21 04:35:00,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:00,952 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:00,953 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:00,954 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:00,963 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:00,963 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:00,963 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_3, ULTIMATE.start_cstrcspn_~sc1~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_3 - 1*ULTIMATE.start_cstrcspn_~sc1~0#1.offset Supporting invariants [] [2022-02-21 04:35:00,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-02-21 04:35:01,059 INFO L297 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2022-02-21 04:35:01,064 INFO L390 LassoCheck]: Loop: "call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);" "assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1;" "call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1;" "assume !cstrcspn_#t~short7#1;" "assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;" "call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);" "assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1;" "cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset;" [2022-02-21 04:35:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:01,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:01,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 04:35:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:01,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:01,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {832#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {832#unseeded} is VALID [2022-02-21 04:35:01,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {832#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {832#unseeded} is VALID [2022-02-21 04:35:01,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {832#unseeded} assume !(main_~length1~0#1 < 1); {832#unseeded} is VALID [2022-02-21 04:35:01,160 INFO L290 TraceCheckUtils]: 3: Hoare triple {832#unseeded} assume !(main_~length2~0#1 < 1); {832#unseeded} is VALID [2022-02-21 04:35:01,160 INFO L290 TraceCheckUtils]: 4: Hoare triple {832#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {937#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} is VALID [2022-02-21 04:35:01,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {937#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {937#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} is VALID [2022-02-21 04:35:01,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {937#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {937#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} is VALID [2022-02-21 04:35:01,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {937#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {937#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} is VALID [2022-02-21 04:35:01,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {937#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} main_~i~1#1 := 0; {937#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} is VALID [2022-02-21 04:35:01,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {937#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {937#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} is VALID [2022-02-21 04:35:01,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {937#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; {916#(and unseeded (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|))} is VALID [2022-02-21 04:35:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:01,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:35:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:01,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:01,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {917#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|))} call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {956#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} is VALID [2022-02-21 04:35:01,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {956#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; {956#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} is VALID [2022-02-21 04:35:01,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {956#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; {956#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} is VALID [2022-02-21 04:35:01,278 INFO L290 TraceCheckUtils]: 3: Hoare triple {956#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} assume !cstrcspn_#t~short7#1; {956#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} is VALID [2022-02-21 04:35:01,279 INFO L290 TraceCheckUtils]: 4: Hoare triple {956#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; {956#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} is VALID [2022-02-21 04:35:01,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {956#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); {956#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} is VALID [2022-02-21 04:35:01,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {956#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; {956#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} is VALID [2022-02-21 04:35:01,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {956#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; {919#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|)))) unseeded))} is VALID [2022-02-21 04:35:01,281 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,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:01,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:01,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 8 letters. [2022-02-21 04:35:01,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,294 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 04:35:01,294 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 14 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:01,351 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 14. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 74 transitions. Complement of second has 5 states. [2022-02-21 04:35:01,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:01,352 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:01,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. cyclomatic complexity: 14 [2022-02-21 04:35:01,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:01,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:01,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:01,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:01,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:01,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:01,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 74 transitions. [2022-02-21 04:35:01,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:01,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:01,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:01,356 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 49 transitions. cyclomatic complexity: 14 [2022-02-21 04:35:01,358 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 17 examples of accepted words. [2022-02-21 04:35:01,358 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:01,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:01,359 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:01,359 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 60 states and 74 transitions. cyclomatic complexity: 20 [2022-02-21 04:35:01,360 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:35:01,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 8 letters. [2022-02-21 04:35:01,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 8 letters. [2022-02-21 04:35:01,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 8 letters. [2022-02-21 04:35:01,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:01,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:01,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:01,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:01,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:01,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:01,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 60 letters. Loop has 60 letters. [2022-02-21 04:35:01,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 60 letters. [2022-02-21 04:35:01,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 60 letters. Loop has 60 letters. [2022-02-21 04:35:01,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 40 letters. Loop has 40 letters. [2022-02-21 04:35:01,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 40 letters. [2022-02-21 04:35:01,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 40 letters. Loop has 40 letters. [2022-02-21 04:35:01,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:01,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:01,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:01,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 8 letters. [2022-02-21 04:35:01,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 8 letters. [2022-02-21 04:35:01,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 17 letters. Loop has 8 letters. [2022-02-21 04:35:01,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 8 letters. [2022-02-21 04:35:01,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 8 letters. [2022-02-21 04:35:01,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 18 letters. Loop has 8 letters. [2022-02-21 04:35:01,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:01,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:01,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:01,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 8 letters. [2022-02-21 04:35:01,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 8 letters. [2022-02-21 04:35:01,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 8 letters. [2022-02-21 04:35:01,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 8 letters. [2022-02-21 04:35:01,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 8 letters. [2022-02-21 04:35:01,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 8 letters. [2022-02-21 04:35:01,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:01,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:01,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:01,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:35:01,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:35:01,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:35:01,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 8 letters. [2022-02-21 04:35:01,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 8 letters. [2022-02-21 04:35:01,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 17 letters. Loop has 8 letters. [2022-02-21 04:35:01,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:01,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:01,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:01,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 8 letters. [2022-02-21 04:35:01,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 8 letters. [2022-02-21 04:35:01,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 8 letters. [2022-02-21 04:35:01,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 8 letters. [2022-02-21 04:35:01,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 8 letters. [2022-02-21 04:35:01,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 8 letters. [2022-02-21 04:35:01,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 8 letters. [2022-02-21 04:35:01,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 8 letters. [2022-02-21 04:35:01,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 8 letters. [2022-02-21 04:35:01,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 8 letters. [2022-02-21 04:35:01,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 8 letters. [2022-02-21 04:35:01,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 18 letters. Loop has 8 letters. [2022-02-21 04:35:01,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 8 letters. [2022-02-21 04:35:01,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 8 letters. [2022-02-21 04:35:01,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 17 letters. Loop has 8 letters. [2022-02-21 04:35:01,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:35:01,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:35:01,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:35:01,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 8 letters. [2022-02-21 04:35:01,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 8 letters. [2022-02-21 04:35:01,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 8 letters. [2022-02-21 04:35:01,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 15 letters. Loop has 8 letters. [2022-02-21 04:35:01,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 8 letters. [2022-02-21 04:35:01,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 8 letters. [2022-02-21 04:35:01,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:01,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:01,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:01,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:01,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:01,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:01,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:01,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:01,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:01,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 14 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:01,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:01,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 74 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:01,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,379 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:01,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-02-21 04:35:01,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 8 letters. [2022-02-21 04:35:01,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 19 letters. Loop has 8 letters. [2022-02-21 04:35:01,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 16 letters. [2022-02-21 04:35:01,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:01,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 74 transitions. cyclomatic complexity: 20 [2022-02-21 04:35:01,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:01,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 39 states and 50 transitions. [2022-02-21 04:35:01,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-02-21 04:35:01,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-02-21 04:35:01,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2022-02-21 04:35:01,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:35:01,383 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2022-02-21 04:35:01,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2022-02-21 04:35:01,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2022-02-21 04:35:01,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:01,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states and 50 transitions. Second operand has 36 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 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,385 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states and 50 transitions. Second operand has 36 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 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,385 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand has 36 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 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,385 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:01,387 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-02-21 04:35:01,387 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2022-02-21 04:35:01,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:01,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:01,388 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 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 39 states and 50 transitions. [2022-02-21 04:35:01,388 INFO L87 Difference]: Start difference. First operand has 36 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 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 39 states and 50 transitions. [2022-02-21 04:35:01,388 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:01,389 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-02-21 04:35:01,390 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2022-02-21 04:35:01,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:01,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:01,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:01,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:01,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 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,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-02-21 04:35:01,391 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-02-21 04:35:01,391 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-02-21 04:35:01,391 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:35:01,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2022-02-21 04:35:01,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:01,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:01,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:01,392 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:01,392 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:01,392 INFO L791 eck$LassoCheckResult]: Stem: 1049#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1050#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 1056#L532 assume !(main_~length1~0#1 < 1); 1053#L532-2 assume !(main_~length2~0#1 < 1); 1047#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 1048#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 1057#L541-4 main_~i~1#1 := 0; 1058#L547-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 1051#L547-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 1052#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 1082#L547-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 1081#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 1070#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 1060#L522-5 [2022-02-21 04:35:01,392 INFO L793 eck$LassoCheckResult]: Loop: 1060#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 1074#L522-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 1059#L522-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 1060#L522-5 [2022-02-21 04:35:01,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:01,393 INFO L85 PathProgramCache]: Analyzing trace with hash -534376483, now seen corresponding path program 1 times [2022-02-21 04:35:01,393 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:01,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764754744] [2022-02-21 04:35:01,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:01,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:01,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {1268#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1268#true} is VALID [2022-02-21 04:35:01,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {1268#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {1268#true} is VALID [2022-02-21 04:35:01,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {1268#true} assume !(main_~length1~0#1 < 1); {1270#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:35:01,506 INFO L290 TraceCheckUtils]: 3: Hoare triple {1270#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} assume !(main_~length2~0#1 < 1); {1270#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:35:01,507 INFO L290 TraceCheckUtils]: 4: Hoare triple {1270#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {1271#(and (or (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (or (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)))} is VALID [2022-02-21 04:35:01,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {1271#(and (or (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (or (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {1272#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} is VALID [2022-02-21 04:35:01,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {1272#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} main_~i~1#1 := 0; {1272#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} is VALID [2022-02-21 04:35:01,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {1272#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; {1272#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} is VALID [2022-02-21 04:35:01,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {1272#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {1272#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} is VALID [2022-02-21 04:35:01,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {1272#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {1272#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} is VALID [2022-02-21 04:35:01,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {1272#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; {1273#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) 0)} is VALID [2022-02-21 04:35:01,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {1273#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) 0)} call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {1274#(= |ULTIMATE.start_cstrcspn_#t~mem3#1| 0)} is VALID [2022-02-21 04:35:01,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {1274#(= |ULTIMATE.start_cstrcspn_#t~mem3#1| 0)} assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; {1269#false} is VALID [2022-02-21 04:35:01,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:35:01,512 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:01,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764754744] [2022-02-21 04:35:01,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764754744] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:01,512 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:01,512 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 04:35:01,512 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496459774] [2022-02-21 04:35:01,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:01,512 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:35:01,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:01,513 INFO L85 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 1 times [2022-02-21 04:35:01,513 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:01,513 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482017188] [2022-02-21 04:35:01,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:01,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,520 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,523 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:01,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:01,628 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:01,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 04:35:01,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-21 04:35:01,629 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. cyclomatic complexity: 16 Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:01,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:01,782 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-21 04:35:01,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 04:35:01,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:01,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:01,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2022-02-21 04:35:01,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:01,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 28 states and 36 transitions. [2022-02-21 04:35:01,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 04:35:01,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 04:35:01,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 36 transitions. [2022-02-21 04:35:01,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:35:01,797 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-21 04:35:01,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 36 transitions. [2022-02-21 04:35:01,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-02-21 04:35:01,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:01,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states and 36 transitions. Second operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 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,799 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states and 36 transitions. Second operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 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,799 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 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,799 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:01,800 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-21 04:35:01,800 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-21 04:35:01,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:01,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:01,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 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 28 states and 36 transitions. [2022-02-21 04:35:01,801 INFO L87 Difference]: Start difference. First operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 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 28 states and 36 transitions. [2022-02-21 04:35:01,801 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:01,802 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-21 04:35:01,802 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-21 04:35:01,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:01,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:01,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:01,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:01,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 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,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-02-21 04:35:01,803 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-02-21 04:35:01,803 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-02-21 04:35:01,803 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 04:35:01,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2022-02-21 04:35:01,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:01,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:01,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:01,804 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:01,804 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:01,804 INFO L791 eck$LassoCheckResult]: Stem: 1321#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1322#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 1326#L532 assume !(main_~length1~0#1 < 1); 1323#L532-2 assume !(main_~length2~0#1 < 1); 1317#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 1318#L541-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 1336#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1337#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 1327#L541-4 main_~i~1#1 := 0; 1328#L547-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 1319#L547-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 1320#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 1334#L547-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 1335#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 1339#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 1330#L522-5 [2022-02-21 04:35:01,804 INFO L793 eck$LassoCheckResult]: Loop: 1330#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 1340#L522-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 1329#L522-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 1330#L522-5 [2022-02-21 04:35:01,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:01,805 INFO L85 PathProgramCache]: Analyzing trace with hash 2055034687, now seen corresponding path program 1 times [2022-02-21 04:35:01,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:01,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413378024] [2022-02-21 04:35:01,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:01,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,822 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,836 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:01,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:01,837 INFO L85 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 2 times [2022-02-21 04:35:01,837 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:01,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016833243] [2022-02-21 04:35:01,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:01,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,845 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,859 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:01,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:01,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1074579938, now seen corresponding path program 1 times [2022-02-21 04:35:01,860 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:01,860 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207526538] [2022-02-21 04:35:01,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:01,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,878 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,888 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:02,961 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:02,961 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:02,961 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:02,961 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:02,961 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:02,961 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:02,961 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:02,961 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:02,961 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration7_Lasso [2022-02-21 04:35:02,961 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:02,961 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:02,963 INFO L141 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,965 INFO L141 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,967 INFO L141 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,969 INFO L141 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,971 INFO L141 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,972 INFO L141 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,974 INFO L141 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,976 INFO L141 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,978 INFO L141 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,979 INFO L141 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,981 INFO L141 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,984 INFO L141 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,986 INFO L141 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,988 INFO L141 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,990 INFO L141 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,992 INFO L141 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,994 INFO L141 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,996 INFO L141 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,998 INFO L141 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:03,000 INFO L141 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:03,003 INFO L141 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:03,005 INFO L141 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:03,007 INFO L141 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:03,697 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 04:35:03,699 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 04:35:03,712 INFO L141 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:03,714 INFO L141 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:03,716 INFO L141 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,589 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:04,589 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:04,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:04,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:04,591 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:04,592 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:04,593 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:04,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:04,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:04,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:04,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:04,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:04,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:04,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:04,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:04,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-02-21 04:35:04,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:04,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:04,623 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:04,624 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:04,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:04,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:04,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:04,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:04,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:04,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:04,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:04,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:04,632 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:04,649 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:04,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:04,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:04,650 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:04,651 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:04,652 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:04,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:04,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:04,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:04,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:04,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:04,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:04,661 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:04,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-02-21 04:35:04,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:04,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:04,677 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:04,678 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:04,680 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:04,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:04,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:04,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:04,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:04,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:04,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:04,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:04,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:04,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-02-21 04:35:04,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:04,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:04,703 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:04,704 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:04,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:04,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:04,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:04,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:04,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:04,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:04,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:04,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:04,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:04,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 04:35:04,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:04,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:04,727 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:04,728 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:04,729 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:04,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:04,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:04,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:04,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:04,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:04,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:04,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:04,736 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:04,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-02-21 04:35:04,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:04,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:04,752 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:04,754 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:04,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:04,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:04,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:04,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:04,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:04,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:04,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:04,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:04,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-02-21 04:35:04,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:04,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:04,779 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:04,780 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:04,781 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:04,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:04,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:04,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:04,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:04,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:04,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:04,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:04,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:04,816 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:04,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:04,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:04,817 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:04,818 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:04,822 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:04,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:04,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:04,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:04,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:04,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:04,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:04,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:04,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:04,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-02-21 04:35:04,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:04,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:04,848 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:04,848 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:04,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:04,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:04,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:04,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:04,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:04,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:04,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:04,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:04,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:04,874 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:04,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:04,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:04,879 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:04,880 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:04,880 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:04,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:04,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:04,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:04,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:04,887 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:04,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:04,889 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:04,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-02-21 04:35:04,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:04,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:04,906 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:04,908 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:04,908 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:04,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:04,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:04,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:04,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:04,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:04,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:04,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:04,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:04,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-02-21 04:35:04,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:04,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:04,931 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:04,932 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:04,934 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:04,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:04,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:04,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:04,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:04,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:04,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:04,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:04,941 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:04,955 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:04,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:04,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:04,957 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:04,959 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:04,959 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:04,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:04,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:04,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:04,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:04,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:04,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:04,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:04,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:04,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:04,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:04,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:04,997 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:04,998 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:05,000 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,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:05,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:05,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:05,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:05,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,023 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:05,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-02-21 04:35:05,027 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,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:05,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:05,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:05,033 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-02-21 04:35:05,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,049 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:05,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-02-21 04:35:05,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:05,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:05,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,058 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:05,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:05,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:05,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,075 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:05,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-02-21 04:35:05,078 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,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:05,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,083 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:05,083 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:05,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-02-21 04:35:05,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,101 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:05,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-02-21 04:35:05,103 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,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:05,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:05,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-02-21 04:35:05,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,128 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:05,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-02-21 04:35:05,134 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,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,140 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:05,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:05,142 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-02-21 04:35:05,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,158 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:05,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-02-21 04:35:05,160 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,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,165 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:05,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,166 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:05,166 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:05,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-02-21 04:35:05,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,184 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:05,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-02-21 04:35:05,186 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,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:05,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:05,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:05,193 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-02-21 04:35:05,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,209 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:05,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-02-21 04:35:05,211 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,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:05,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:05,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-02-21 04:35:05,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,235 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:05,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-02-21 04:35:05,237 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,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:05,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:05,249 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:05,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,265 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:05,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-02-21 04:35:05,267 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,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:05,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:05,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-02-21 04:35:05,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,292 INFO L229 MonitoredProcess]: Starting monitored process 58 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,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-02-21 04:35:05,300 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,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,311 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:05,311 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:05,319 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-02-21 04:35:05,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,336 INFO L229 MonitoredProcess]: Starting monitored process 59 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,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-02-21 04:35:05,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:05,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:05,344 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:05,346 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-02-21 04:35:05,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,362 INFO L229 MonitoredProcess]: Starting monitored process 60 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,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-02-21 04:35:05,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:05,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:05,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:05,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-02-21 04:35:05,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,388 INFO L229 MonitoredProcess]: Starting monitored process 61 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,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-02-21 04:35:05,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:05,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:05,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:05,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-02-21 04:35:05,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,416 INFO L229 MonitoredProcess]: Starting monitored process 62 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,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-02-21 04:35:05,418 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,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,433 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:05,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:05,449 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:05,496 INFO L443 ModelExtractionUtils]: Simplification made 25 calls to the SMT solver. [2022-02-21 04:35:05,496 INFO L444 ModelExtractionUtils]: 19 out of 58 variables were initially zero. Simplification set additionally 36 variables to zero. [2022-02-21 04:35:05,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,498 INFO L229 MonitoredProcess]: Starting monitored process 63 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,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-02-21 04:35:05,499 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:05,506 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:05,506 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:05,506 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_3, ULTIMATE.start_cstrcspn_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_3 - 1*ULTIMATE.start_cstrcspn_~s~0#1.offset Supporting invariants [] [2022-02-21 04:35:05,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-02-21 04:35:05,636 INFO L297 tatePredicateManager]: 26 out of 28 supporting invariants were superfluous and have been removed [2022-02-21 04:35:05,642 INFO L390 LassoCheck]: Loop: "call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1;" "assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256);" "assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset;" [2022-02-21 04:35:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:05,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:05,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 04:35:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:05,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:05,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {1490#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1490#unseeded} is VALID [2022-02-21 04:35:05,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {1490#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {1490#unseeded} is VALID [2022-02-21 04:35:05,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {1490#unseeded} assume !(main_~length1~0#1 < 1); {1490#unseeded} is VALID [2022-02-21 04:35:05,778 INFO L290 TraceCheckUtils]: 3: Hoare triple {1490#unseeded} assume !(main_~length2~0#1 < 1); {1490#unseeded} is VALID [2022-02-21 04:35:05,779 INFO L290 TraceCheckUtils]: 4: Hoare triple {1490#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {1666#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:05,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {1666#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {1666#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:05,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {1666#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {1666#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:05,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {1666#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {1666#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:05,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {1666#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} main_~i~1#1 := 0; {1666#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:05,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {1666#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; {1666#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:05,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {1666#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {1666#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:05,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {1666#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {1666#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:05,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {1666#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; {1691#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:05,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {1691#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {1691#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:05,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {1691#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; {1645#(and unseeded (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:05,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 04:35:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:05,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:05,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {1646#(and (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; {1698#(and (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:05,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {1698#(and (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); {1698#(and (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:05,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {1698#(and (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; {1648#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)))) unseeded) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:05,854 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:05,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:05,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:05,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:05,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,865 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2022-02-21 04:35:05,866 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:05,945 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 54 states and 67 transitions. Complement of second has 7 states. [2022-02-21 04:35:05,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:05,945 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:05,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. cyclomatic complexity: 12 [2022-02-21 04:35:05,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:05,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:05,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:05,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:05,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:05,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:05,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 67 transitions. [2022-02-21 04:35:05,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:05,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:05,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:05,946 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 35 transitions. cyclomatic complexity: 12 [2022-02-21 04:35:05,947 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:35:05,947 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:05,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:05,947 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:05,947 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 54 states and 67 transitions. cyclomatic complexity: 19 [2022-02-21 04:35:05,948 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:35:05,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:05,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:05,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 67 transitions. cyclomatic complexity: 19 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:05,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:05,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:05,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 67 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:05,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 12 Stem has 23 letters. Loop has 3 letters. [2022-02-21 04:35:05,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 3 letters. [2022-02-21 04:35:05,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 67 transitions. cyclomatic complexity: 19 Stem has 23 letters. Loop has 3 letters. [2022-02-21 04:35:05,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 12 Stem has 54 letters. Loop has 54 letters. [2022-02-21 04:35:05,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 54 letters. [2022-02-21 04:35:05,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 67 transitions. cyclomatic complexity: 19 Stem has 54 letters. Loop has 54 letters. [2022-02-21 04:35:05,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 12 Stem has 27 letters. Loop has 27 letters. [2022-02-21 04:35:05,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 27 letters. [2022-02-21 04:35:05,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 67 transitions. cyclomatic complexity: 19 Stem has 27 letters. Loop has 27 letters. [2022-02-21 04:35:05,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:05,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:05,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 67 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:05,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 12 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:05,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:05,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 67 transitions. cyclomatic complexity: 19 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:05,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:05,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:05,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 67 transitions. cyclomatic complexity: 19 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:05,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:05,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:05,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 67 transitions. cyclomatic complexity: 19 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:05,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:05,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:05,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 67 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:05,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 12 Stem has 24 letters. Loop has 3 letters. [2022-02-21 04:35:05,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 3 letters. [2022-02-21 04:35:05,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 67 transitions. cyclomatic complexity: 19 Stem has 24 letters. Loop has 3 letters. [2022-02-21 04:35:05,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 12 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:05,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:05,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 67 transitions. cyclomatic complexity: 19 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:05,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 12 Stem has 23 letters. Loop has 3 letters. [2022-02-21 04:35:05,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 3 letters. [2022-02-21 04:35:05,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 67 transitions. cyclomatic complexity: 19 Stem has 23 letters. Loop has 3 letters. [2022-02-21 04:35:05,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,954 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:05,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:05,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-02-21 04:35:05,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:05,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 18 letters. Loop has 3 letters. [2022-02-21 04:35:05,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 15 letters. Loop has 6 letters. [2022-02-21 04:35:05,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 67 transitions. cyclomatic complexity: 19 [2022-02-21 04:35:05,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:05,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 40 states and 50 transitions. [2022-02-21 04:35:05,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-02-21 04:35:05,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 04:35:05,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 50 transitions. [2022-02-21 04:35:05,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:35:05,958 INFO L681 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-02-21 04:35:05,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 50 transitions. [2022-02-21 04:35:05,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2022-02-21 04:35:05,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:05,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states and 50 transitions. Second operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:05,964 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states and 50 transitions. Second operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:05,964 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:05,964 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:05,965 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-02-21 04:35:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-02-21 04:35:05,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:05,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:05,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 40 states and 50 transitions. [2022-02-21 04:35:05,966 INFO L87 Difference]: Start difference. First operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 40 states and 50 transitions. [2022-02-21 04:35:05,966 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:05,967 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-02-21 04:35:05,968 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-02-21 04:35:05,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:05,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:05,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:05,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-02-21 04:35:05,970 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-02-21 04:35:05,970 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-02-21 04:35:05,970 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 04:35:05,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2022-02-21 04:35:05,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:05,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:05,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:05,971 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:05,971 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:05,971 INFO L791 eck$LassoCheckResult]: Stem: 1773#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1774#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 1780#L532 assume !(main_~length1~0#1 < 1); 1777#L532-2 assume !(main_~length2~0#1 < 1); 1771#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 1772#L541-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 1790#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1791#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 1781#L541-4 main_~i~1#1 := 0; 1782#L547-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 1775#L547-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 1776#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 1788#L547-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 1789#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 1792#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 1800#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 1796#L522-1 assume !cstrcspn_#t~short7#1; 1785#L522-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 1778#L522-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 1779#L524 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 1786#L519-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 1787#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 1794#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 1784#L522-5 [2022-02-21 04:35:05,971 INFO L793 eck$LassoCheckResult]: Loop: 1784#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 1795#L522-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 1783#L522-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 1784#L522-5 [2022-02-21 04:35:05,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:05,971 INFO L85 PathProgramCache]: Analyzing trace with hash -777149455, now seen corresponding path program 1 times [2022-02-21 04:35:05,972 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:05,972 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216804543] [2022-02-21 04:35:05,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:05,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [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 (63)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:06,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {1982#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1982#true} is VALID [2022-02-21 04:35:06,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {1982#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {1982#true} is VALID [2022-02-21 04:35:06,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {1982#true} assume !(main_~length1~0#1 < 1); {1982#true} is VALID [2022-02-21 04:35:06,172 INFO L290 TraceCheckUtils]: 3: Hoare triple {1982#true} assume !(main_~length2~0#1 < 1); {1982#true} is VALID [2022-02-21 04:35:06,173 INFO L290 TraceCheckUtils]: 4: Hoare triple {1982#true} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {1984#(and (= |ULTIMATE.start_main_~i~0#1| 0) (or (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (not (= 2 (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|)))) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:06,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {1984#(and (= |ULTIMATE.start_main_~i~0#1| 0) (or (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (not (= 2 (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|)))) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {1985#(and (= |ULTIMATE.start_main_~i~0#1| 0) (or (<= 3 (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|)) (and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length1~0#1|))) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:06,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {1985#(and (= |ULTIMATE.start_main_~i~0#1| 0) (or (<= 3 (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|)) (and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length1~0#1|))) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {1986#(and (or (and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1)) (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|))) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:06,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {1986#(and (or (and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1)) (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|))) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {1987#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} is VALID [2022-02-21 04:35:06,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {1987#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} main_~i~1#1 := 0; {1987#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} is VALID [2022-02-21 04:35:06,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {1987#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; {1987#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} is VALID [2022-02-21 04:35:06,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {1987#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {1987#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} is VALID [2022-02-21 04:35:06,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {1987#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {1987#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} is VALID [2022-02-21 04:35:06,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {1987#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} is VALID [2022-02-21 04:35:06,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} is VALID [2022-02-21 04:35:06,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} is VALID [2022-02-21 04:35:06,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} is VALID [2022-02-21 04:35:06,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} assume !cstrcspn_#t~short7#1; {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} is VALID [2022-02-21 04:35:06,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} is VALID [2022-02-21 04:35:06,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} is VALID [2022-02-21 04:35:06,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} is VALID [2022-02-21 04:35:06,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; {1989#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) 0)} is VALID [2022-02-21 04:35:06,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {1989#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) 0)} call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {1990#(= |ULTIMATE.start_cstrcspn_#t~mem3#1| 0)} is VALID [2022-02-21 04:35:06,187 INFO L290 TraceCheckUtils]: 22: Hoare triple {1990#(= |ULTIMATE.start_cstrcspn_#t~mem3#1| 0)} assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; {1983#false} is VALID [2022-02-21 04:35:06,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:35:06,188 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:06,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216804543] [2022-02-21 04:35:06,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216804543] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:35:06,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996816589] [2022-02-21 04:35:06,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:06,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:35:06,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,200 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:35:06,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-02-21 04:35:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:06,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 38 conjunts are in the unsatisfiable core [2022-02-21 04:35:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:06,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:06,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-21 04:35:06,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-02-21 04:35:06,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-02-21 04:35:07,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-21 04:35:07,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {1982#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1982#true} is VALID [2022-02-21 04:35:07,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {1982#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {1982#true} is VALID [2022-02-21 04:35:07,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {1982#true} assume !(main_~length1~0#1 < 1); {1982#true} is VALID [2022-02-21 04:35:07,160 INFO L290 TraceCheckUtils]: 3: Hoare triple {1982#true} assume !(main_~length2~0#1 < 1); {1982#true} is VALID [2022-02-21 04:35:07,161 INFO L290 TraceCheckUtils]: 4: Hoare triple {1982#true} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {2006#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:07,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {2006#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {2010#(and (= |ULTIMATE.start_main_~i~0#1| 0) (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~length1~0#1|) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:07,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {2010#(and (= |ULTIMATE.start_main_~i~0#1| 0) (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~length1~0#1|) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {2014#(and (< 1 |ULTIMATE.start_main_~length1~0#1|) (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_~i~0#1| 1))} is VALID [2022-02-21 04:35:07,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {2014#(and (< 1 |ULTIMATE.start_main_~length1~0#1|) (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_~i~0#1| 1))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {2018#(and (< 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_main_~length1~0#1| 2) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:07,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {2018#(and (< 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_main_~length1~0#1| 2) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} main_~i~1#1 := 0; {2018#(and (< 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_main_~length1~0#1| 2) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:07,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {2018#(and (< 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_main_~length1~0#1| 2) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; {2018#(and (< 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_main_~length1~0#1| 2) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:07,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {2018#(and (< 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_main_~length1~0#1| 2) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {2018#(and (< 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_main_~length1~0#1| 2) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:07,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {2018#(and (< 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_main_~length1~0#1| 2) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {2018#(and (< 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_main_~length1~0#1| 2) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:07,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {2018#(and (< 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_main_~length1~0#1| 2) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; {2034#(exists ((|ULTIMATE.start_main_~nondetString1~0#1.offset| Int) (|ULTIMATE.start_main_~length1~0#1| Int)) (and (< 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_main_~length1~0#1| 2) (<= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| |ULTIMATE.start_main_~nondetString1~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|)) 0)))} is VALID [2022-02-21 04:35:07,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {2034#(exists ((|ULTIMATE.start_main_~nondetString1~0#1.offset| Int) (|ULTIMATE.start_main_~length1~0#1| Int)) (and (< 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_main_~length1~0#1| 2) (<= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| |ULTIMATE.start_main_~nondetString1~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|)) 0)))} call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} is VALID [2022-02-21 04:35:07,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} is VALID [2022-02-21 04:35:07,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} is VALID [2022-02-21 04:35:07,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} assume !cstrcspn_#t~short7#1; {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} is VALID [2022-02-21 04:35:07,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} is VALID [2022-02-21 04:35:07,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} is VALID [2022-02-21 04:35:07,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} is VALID [2022-02-21 04:35:07,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {1988#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0) (= |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 0))} cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; {2059#(and (= (+ (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0))} is VALID [2022-02-21 04:35:07,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {2059#(and (= (+ (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) 1) 0))} call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {1990#(= |ULTIMATE.start_cstrcspn_#t~mem3#1| 0)} is VALID [2022-02-21 04:35:07,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {1990#(= |ULTIMATE.start_cstrcspn_#t~mem3#1| 0)} assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; {1983#false} is VALID [2022-02-21 04:35:07,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:35:07,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:35:07,337 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 04:35:07,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-02-21 04:35:07,356 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 04:35:07,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-02-21 04:35:07,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 04:35:07,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {1990#(= |ULTIMATE.start_cstrcspn_#t~mem3#1| 0)} assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; {1983#false} is VALID [2022-02-21 04:35:07,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {1989#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) 0)} call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {1990#(= |ULTIMATE.start_cstrcspn_#t~mem3#1| 0)} is VALID [2022-02-21 04:35:07,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {2072#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1)) 0)} cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; {1989#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) 0)} is VALID [2022-02-21 04:35:07,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {2072#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1)) 0)} assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; {2072#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1)) 0)} is VALID [2022-02-21 04:35:07,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {2072#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1)) 0)} call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); {2072#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1)) 0)} is VALID [2022-02-21 04:35:07,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {2072#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1)) 0)} assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; {2072#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1)) 0)} is VALID [2022-02-21 04:35:07,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {2072#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1)) 0)} assume !cstrcspn_#t~short7#1; {2072#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1)) 0)} is VALID [2022-02-21 04:35:07,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {2072#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1)) 0)} call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; {2072#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1)) 0)} is VALID [2022-02-21 04:35:07,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {2072#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1)) 0)} assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; {2072#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1)) 0)} is VALID [2022-02-21 04:35:07,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {2094#(or (not (<= 0 |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1)) 0))} call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {2072#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1)) 0)} is VALID [2022-02-21 04:35:07,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {2098#(and (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~length1~0#1|)) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 2)))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; {2094#(or (not (<= 0 |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1)) 0))} is VALID [2022-02-21 04:35:07,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {2098#(and (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~length1~0#1|)) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 2)))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {2098#(and (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~length1~0#1|)) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 2)))} is VALID [2022-02-21 04:35:07,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {2098#(and (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~length1~0#1|)) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 2)))} main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {2098#(and (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~length1~0#1|)) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 2)))} is VALID [2022-02-21 04:35:07,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {2098#(and (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~length1~0#1|)) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 2)))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; {2098#(and (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~length1~0#1|)) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 2)))} is VALID [2022-02-21 04:35:07,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {2098#(and (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~length1~0#1|)) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 2)))} main_~i~1#1 := 0; {2098#(and (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~length1~0#1|)) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 2)))} is VALID [2022-02-21 04:35:07,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {2114#(or (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~length1~0#1|) (and (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~length1~0#1|)) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 2))))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {2098#(and (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~length1~0#1|)) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 2)))} is VALID [2022-02-21 04:35:07,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {2118#(or (< (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length1~0#1|) (and (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~length1~0#1|)) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 2))))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {2114#(or (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~length1~0#1|) (and (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~length1~0#1|)) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 2))))} is VALID [2022-02-21 04:35:07,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {2122#(and (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~i~0#1|) 0)) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {2118#(or (< (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length1~0#1|) (and (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~length1~0#1|)) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 2))))} is VALID [2022-02-21 04:35:07,854 INFO L290 TraceCheckUtils]: 4: Hoare triple {1982#true} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {2122#(and (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~i~0#1|) 0)) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (or (< |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 04:35:07,854 INFO L290 TraceCheckUtils]: 3: Hoare triple {1982#true} assume !(main_~length2~0#1 < 1); {1982#true} is VALID [2022-02-21 04:35:07,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {1982#true} assume !(main_~length1~0#1 < 1); {1982#true} is VALID [2022-02-21 04:35:07,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {1982#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {1982#true} is VALID [2022-02-21 04:35:07,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {1982#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1982#true} is VALID [2022-02-21 04:35:07,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:35:07,855 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996816589] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:35:07,855 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:35:07,855 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2022-02-21 04:35:07,855 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633827349] [2022-02-21 04:35:07,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:35:07,855 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:35:07,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:07,855 INFO L85 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 3 times [2022-02-21 04:35:07,855 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:07,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453876769] [2022-02-21 04:35:07,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:07,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:07,861 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:07,863 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:07,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:07,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-21 04:35:07,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2022-02-21 04:35:07,956 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. cyclomatic complexity: 14 Second operand has 21 states, 20 states have (on average 2.6) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 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:08,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:08,450 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2022-02-21 04:35:08,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 04:35:08,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 2.6) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 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:08,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:08,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 65 transitions. [2022-02-21 04:35:08,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:08,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 35 states and 44 transitions. [2022-02-21 04:35:08,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 04:35:08,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 04:35:08,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2022-02-21 04:35:08,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:35:08,496 INFO L681 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-02-21 04:35:08,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2022-02-21 04:35:08,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-02-21 04:35:08,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:08,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states and 44 transitions. Second operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 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:08,497 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states and 44 transitions. Second operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 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:08,497 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 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:08,498 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:08,501 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-21 04:35:08,501 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-02-21 04:35:08,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:08,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:08,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 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 35 states and 44 transitions. [2022-02-21 04:35:08,501 INFO L87 Difference]: Start difference. First operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 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 35 states and 44 transitions. [2022-02-21 04:35:08,502 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:08,502 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-21 04:35:08,502 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-02-21 04:35:08,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:08,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:08,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:08,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:08,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 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:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-02-21 04:35:08,503 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-02-21 04:35:08,503 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-02-21 04:35:08,503 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 04:35:08,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2022-02-21 04:35:08,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:08,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:08,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:08,504 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:08,504 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:08,504 INFO L791 eck$LassoCheckResult]: Stem: 2206#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2207#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 2213#L532 assume !(main_~length1~0#1 < 1); 2210#L532-2 assume !(main_~length2~0#1 < 1); 2204#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 2205#L541-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 2224#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2225#L541-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 2226#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2235#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 2214#L541-4 main_~i~1#1 := 0; 2215#L547-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 2208#L547-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 2209#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 2222#L547-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 2223#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 2227#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 2219#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 2231#L522-1 assume !cstrcspn_#t~short7#1; 2232#L522-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 2211#L522-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 2212#L524 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 2220#L519-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 2221#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 2229#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 2217#L522-5 [2022-02-21 04:35:08,516 INFO L793 eck$LassoCheckResult]: Loop: 2217#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 2230#L522-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 2216#L522-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 2217#L522-5 [2022-02-21 04:35:08,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:08,516 INFO L85 PathProgramCache]: Analyzing trace with hash 409245907, now seen corresponding path program 2 times [2022-02-21 04:35:08,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:08,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992043431] [2022-02-21 04:35:08,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:08,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:08,561 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:08,574 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:08,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:08,575 INFO L85 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 4 times [2022-02-21 04:35:08,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:08,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863283244] [2022-02-21 04:35:08,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:08,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:08,580 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:08,582 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:08,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:08,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1567281202, now seen corresponding path program 1 times [2022-02-21 04:35:08,583 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:08,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274999131] [2022-02-21 04:35:08,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:08,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:08,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {2418#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2418#true} is VALID [2022-02-21 04:35:08,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {2418#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {2418#true} is VALID [2022-02-21 04:35:08,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#true} assume !(main_~length1~0#1 < 1); {2418#true} is VALID [2022-02-21 04:35:08,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {2418#true} assume !(main_~length2~0#1 < 1); {2418#true} is VALID [2022-02-21 04:35:08,677 INFO L290 TraceCheckUtils]: 4: Hoare triple {2418#true} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {2418#true} is VALID [2022-02-21 04:35:08,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {2418#true} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {2418#true} is VALID [2022-02-21 04:35:08,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {2418#true} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {2418#true} is VALID [2022-02-21 04:35:08,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {2418#true} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {2418#true} is VALID [2022-02-21 04:35:08,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {2418#true} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {2418#true} is VALID [2022-02-21 04:35:08,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#true} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {2418#true} is VALID [2022-02-21 04:35:08,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {2418#true} main_~i~1#1 := 0; {2418#true} is VALID [2022-02-21 04:35:08,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {2418#true} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; {2418#true} is VALID [2022-02-21 04:35:08,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {2418#true} main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {2418#true} is VALID [2022-02-21 04:35:08,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {2418#true} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {2418#true} is VALID [2022-02-21 04:35:08,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#true} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; {2418#true} is VALID [2022-02-21 04:35:08,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {2418#true} call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {2418#true} is VALID [2022-02-21 04:35:08,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#true} assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; {2420#(and (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} is VALID [2022-02-21 04:35:08,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {2420#(and (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; {2421#(or (and (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) |ULTIMATE.start_cstrcspn_#t~short7#1|)} is VALID [2022-02-21 04:35:08,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {2421#(or (and (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) |ULTIMATE.start_cstrcspn_#t~short7#1|)} assume !cstrcspn_#t~short7#1; {2422#(and (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} is VALID [2022-02-21 04:35:08,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {2422#(and (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; {2422#(and (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} is VALID [2022-02-21 04:35:08,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {2422#(and (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); {2423#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 04:35:08,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {2423#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; {2423#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 04:35:08,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {2423#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; {2423#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 04:35:08,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {2423#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {2423#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 04:35:08,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {2423#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; {2424#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0)} is VALID [2022-02-21 04:35:08,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {2424#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0)} call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; {2425#(not |ULTIMATE.start_cstrcspn_#t~short7#1|)} is VALID [2022-02-21 04:35:08,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {2425#(not |ULTIMATE.start_cstrcspn_#t~short7#1|)} assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); {2419#false} is VALID [2022-02-21 04:35:08,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {2419#false} assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; {2419#false} is VALID [2022-02-21 04:35:08,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 04:35:08,683 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:08,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274999131] [2022-02-21 04:35:08,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274999131] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:35:08,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820144954] [2022-02-21 04:35:08,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:08,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:35:08,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:08,684 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:35:08,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-02-21 04:35:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:08,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 35 conjunts are in the unsatisfiable core [2022-02-21 04:35:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:08,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:08,910 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-21 04:35:08,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-21 04:35:09,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {2418#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2418#true} is VALID [2022-02-21 04:35:09,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {2418#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {2418#true} is VALID [2022-02-21 04:35:09,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#true} assume !(main_~length1~0#1 < 1); {2418#true} is VALID [2022-02-21 04:35:09,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {2418#true} assume !(main_~length2~0#1 < 1); {2418#true} is VALID [2022-02-21 04:35:09,091 INFO L290 TraceCheckUtils]: 4: Hoare triple {2418#true} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {2441#(= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} is VALID [2022-02-21 04:35:09,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {2441#(= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {2441#(= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} is VALID [2022-02-21 04:35:09,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {2441#(= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {2441#(= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} is VALID [2022-02-21 04:35:09,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {2441#(= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {2441#(= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} is VALID [2022-02-21 04:35:09,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {2441#(= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {2441#(= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} is VALID [2022-02-21 04:35:09,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {2441#(= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {2441#(= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} is VALID [2022-02-21 04:35:09,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {2441#(= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} main_~i~1#1 := 0; {2460#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} is VALID [2022-02-21 04:35:09,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {2460#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; {2464#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:09,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {2464#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length2~0#1|))} main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {2468#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~1#1| 1) (< 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:09,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {2468#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~1#1| 1) (< 1 |ULTIMATE.start_main_~length2~0#1|))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {2441#(= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} is VALID [2022-02-21 04:35:09,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {2441#(= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; {2475#(<= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0)} is VALID [2022-02-21 04:35:09,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {2475#(<= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0)} call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {2475#(<= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0)} is VALID [2022-02-21 04:35:09,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {2475#(<= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0)} assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; {2482#(and (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (<= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} is VALID [2022-02-21 04:35:09,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {2482#(and (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (<= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; {2486#(and (<= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (or (and (not |ULTIMATE.start_cstrcspn_#t~short7#1|) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)) (and |ULTIMATE.start_cstrcspn_#t~short7#1| (not (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)))))} is VALID [2022-02-21 04:35:09,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {2486#(and (<= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (or (and (not |ULTIMATE.start_cstrcspn_#t~short7#1|) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)) (and |ULTIMATE.start_cstrcspn_#t~short7#1| (not (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)))))} assume !cstrcspn_#t~short7#1; {2490#(and (<= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} is VALID [2022-02-21 04:35:09,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {2490#(and (<= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; {2490#(and (<= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} is VALID [2022-02-21 04:35:09,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {2490#(and (<= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); {2490#(and (<= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} is VALID [2022-02-21 04:35:09,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {2490#(and (<= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; {2490#(and (<= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} is VALID [2022-02-21 04:35:09,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {2490#(and (<= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; {2490#(and (<= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} is VALID [2022-02-21 04:35:09,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {2490#(and (<= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {2490#(and (<= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} is VALID [2022-02-21 04:35:09,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {2490#(and (<= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; {2509#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0) (<= |ULTIMATE.start_cstrcspn_~s~0#1.offset| 0))} is VALID [2022-02-21 04:35:09,102 INFO L290 TraceCheckUtils]: 25: Hoare triple {2509#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0) (<= |ULTIMATE.start_cstrcspn_~s~0#1.offset| 0))} call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; {2425#(not |ULTIMATE.start_cstrcspn_#t~short7#1|)} is VALID [2022-02-21 04:35:09,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {2425#(not |ULTIMATE.start_cstrcspn_#t~short7#1|)} assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); {2419#false} is VALID [2022-02-21 04:35:09,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {2419#false} assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; {2419#false} is VALID [2022-02-21 04:35:09,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 04:35:09,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:35:09,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {2419#false} assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; {2419#false} is VALID [2022-02-21 04:35:09,257 INFO L290 TraceCheckUtils]: 26: Hoare triple {2425#(not |ULTIMATE.start_cstrcspn_#t~short7#1|)} assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); {2419#false} is VALID [2022-02-21 04:35:09,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {2525#(or (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0) (not (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|)))} call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; {2425#(not |ULTIMATE.start_cstrcspn_#t~short7#1|)} is VALID [2022-02-21 04:35:09,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {2529#(or (not (<= 0 |ULTIMATE.start_cstrcspn_~s2#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; {2525#(or (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0) (not (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|)))} is VALID [2022-02-21 04:35:09,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {2529#(or (not (<= 0 |ULTIMATE.start_cstrcspn_~s2#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {2529#(or (not (<= 0 |ULTIMATE.start_cstrcspn_~s2#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} is VALID [2022-02-21 04:35:09,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {2529#(or (not (<= 0 |ULTIMATE.start_cstrcspn_~s2#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; {2529#(or (not (<= 0 |ULTIMATE.start_cstrcspn_~s2#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} is VALID [2022-02-21 04:35:09,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {2529#(or (not (<= 0 |ULTIMATE.start_cstrcspn_~s2#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; {2529#(or (not (<= 0 |ULTIMATE.start_cstrcspn_~s2#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} is VALID [2022-02-21 04:35:09,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {2529#(or (not (<= 0 |ULTIMATE.start_cstrcspn_~s2#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); {2529#(or (not (<= 0 |ULTIMATE.start_cstrcspn_~s2#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} is VALID [2022-02-21 04:35:09,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {2529#(or (not (<= 0 |ULTIMATE.start_cstrcspn_~s2#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; {2529#(or (not (<= 0 |ULTIMATE.start_cstrcspn_~s2#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} is VALID [2022-02-21 04:35:09,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {2548#(or |ULTIMATE.start_cstrcspn_#t~short7#1| (not (<= 0 |ULTIMATE.start_cstrcspn_~s2#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} assume !cstrcspn_#t~short7#1; {2529#(or (not (<= 0 |ULTIMATE.start_cstrcspn_~s2#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} is VALID [2022-02-21 04:35:09,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {2552#(or (not (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_cstrcspn_~s2#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; {2548#(or |ULTIMATE.start_cstrcspn_#t~short7#1| (not (<= 0 |ULTIMATE.start_cstrcspn_~s2#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} is VALID [2022-02-21 04:35:09,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#true} assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; {2552#(or (not (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_cstrcspn_~s2#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} is VALID [2022-02-21 04:35:09,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {2418#true} call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {2418#true} is VALID [2022-02-21 04:35:09,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#true} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; {2418#true} is VALID [2022-02-21 04:35:09,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {2418#true} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {2418#true} is VALID [2022-02-21 04:35:09,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {2418#true} main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {2418#true} is VALID [2022-02-21 04:35:09,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {2418#true} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; {2418#true} is VALID [2022-02-21 04:35:09,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {2418#true} main_~i~1#1 := 0; {2418#true} is VALID [2022-02-21 04:35:09,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#true} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {2418#true} is VALID [2022-02-21 04:35:09,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {2418#true} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {2418#true} is VALID [2022-02-21 04:35:09,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {2418#true} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {2418#true} is VALID [2022-02-21 04:35:09,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {2418#true} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {2418#true} is VALID [2022-02-21 04:35:09,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {2418#true} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {2418#true} is VALID [2022-02-21 04:35:09,262 INFO L290 TraceCheckUtils]: 4: Hoare triple {2418#true} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {2418#true} is VALID [2022-02-21 04:35:09,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {2418#true} assume !(main_~length2~0#1 < 1); {2418#true} is VALID [2022-02-21 04:35:09,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#true} assume !(main_~length1~0#1 < 1); {2418#true} is VALID [2022-02-21 04:35:09,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {2418#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {2418#true} is VALID [2022-02-21 04:35:09,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {2418#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2418#true} is VALID [2022-02-21 04:35:09,263 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 04:35:09,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820144954] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:35:09,263 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:35:09,263 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 7] total 21 [2022-02-21 04:35:09,263 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778622452] [2022-02-21 04:35:09,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:35:09,356 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:09,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-21 04:35:09,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-02-21 04:35:09,357 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 14 Second operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 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:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:09,980 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2022-02-21 04:35:09,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-21 04:35:09,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 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:10,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:10,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 140 transitions. [2022-02-21 04:35:10,020 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 04:35:10,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 93 states and 114 transitions. [2022-02-21 04:35:10,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-02-21 04:35:10,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2022-02-21 04:35:10,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 114 transitions. [2022-02-21 04:35:10,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:35:10,022 INFO L681 BuchiCegarLoop]: Abstraction has 93 states and 114 transitions. [2022-02-21 04:35:10,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 114 transitions. [2022-02-21 04:35:10,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 38. [2022-02-21 04:35:10,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:10,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states and 114 transitions. Second operand has 38 states, 38 states have (on average 1.263157894736842) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 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:10,023 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states and 114 transitions. Second operand has 38 states, 38 states have (on average 1.263157894736842) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 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:10,023 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand has 38 states, 38 states have (on average 1.263157894736842) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 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:10,024 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:10,025 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2022-02-21 04:35:10,025 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2022-02-21 04:35:10,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:10,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:10,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 38 states have (on average 1.263157894736842) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 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 93 states and 114 transitions. [2022-02-21 04:35:10,025 INFO L87 Difference]: Start difference. First operand has 38 states, 38 states have (on average 1.263157894736842) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 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 93 states and 114 transitions. [2022-02-21 04:35:10,027 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:10,029 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2022-02-21 04:35:10,029 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2022-02-21 04:35:10,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:10,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:10,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:10,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:10,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.263157894736842) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 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:10,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-02-21 04:35:10,030 INFO L704 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-02-21 04:35:10,030 INFO L587 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-02-21 04:35:10,030 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 04:35:10,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2022-02-21 04:35:10,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:10,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:10,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:10,031 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:10,031 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:10,031 INFO L791 eck$LassoCheckResult]: Stem: 2748#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2749#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 2755#L532 assume !(main_~length1~0#1 < 1); 2752#L532-2 assume !(main_~length2~0#1 < 1); 2746#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 2747#L541-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 2766#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2767#L541-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 2768#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2778#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 2756#L541-4 main_~i~1#1 := 0; 2757#L547-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 2750#L547-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 2751#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 2764#L547-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 2765#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 2769#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 2780#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 2773#L522-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 2774#L522-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 2753#L522-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 2754#L524 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 2758#L519-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 2759#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 2771#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 2761#L522-5 [2022-02-21 04:35:10,031 INFO L793 eck$LassoCheckResult]: Loop: 2761#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 2772#L522-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 2760#L522-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 2761#L522-5 [2022-02-21 04:35:10,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:10,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1365761455, now seen corresponding path program 1 times [2022-02-21 04:35:10,032 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:10,032 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916804121] [2022-02-21 04:35:10,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:10,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:10,058 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:10,088 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:10,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:10,088 INFO L85 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 5 times [2022-02-21 04:35:10,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:10,088 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654569746] [2022-02-21 04:35:10,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:10,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:10,093 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:10,095 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:10,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:10,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1174254192, now seen corresponding path program 1 times [2022-02-21 04:35:10,095 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:10,095 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380874802] [2022-02-21 04:35:10,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:10,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:10,129 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:10,148 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:11,971 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:11,971 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:11,971 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:11,971 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:11,971 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:11,971 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:11,972 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:11,972 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:11,972 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration10_Lasso [2022-02-21 04:35:11,972 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:11,972 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:11,974 INFO L141 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:11,976 INFO L141 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:11,978 INFO L141 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:11,979 INFO L141 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:11,981 INFO L141 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:11,983 INFO L141 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:11,986 INFO L141 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:11,987 INFO L141 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:11,989 INFO L141 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:11,990 INFO L141 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:11,992 INFO L141 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:11,993 INFO L141 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:11,995 INFO L141 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:11,996 INFO L141 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:11,999 INFO L141 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:12,001 INFO L141 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:12,004 INFO L141 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:12,005 INFO L141 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:12,007 INFO L141 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:12,008 INFO L141 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:12,010 INFO L141 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:13,113 WARN L259 bleTransFormulaUtils]: 3 quantified variables [2022-02-21 04:35:13,115 WARN L259 bleTransFormulaUtils]: 3 quantified variables [2022-02-21 04:35:13,123 INFO L141 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:13,126 INFO L141 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:13,127 INFO L141 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:13,129 INFO L141 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:15,001 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:15,002 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:15,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,003 INFO L229 MonitoredProcess]: Starting monitored process 66 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:15,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-02-21 04:35:15,005 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:15,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:15,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:15,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:15,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:15,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:15,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:15,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:15,015 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:15,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-02-21 04:35:15,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,032 INFO L229 MonitoredProcess]: Starting monitored process 67 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:15,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-02-21 04:35:15,034 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:15,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:15,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:15,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:15,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:15,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:15,040 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:15,040 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:15,041 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:15,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-02-21 04:35:15,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,058 INFO L229 MonitoredProcess]: Starting monitored process 68 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:15,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-02-21 04:35:15,060 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:15,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:15,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:15,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:15,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:15,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:15,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:15,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:15,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:15,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-02-21 04:35:15,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,084 INFO L229 MonitoredProcess]: Starting monitored process 69 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:15,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-02-21 04:35:15,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:15,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:15,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:15,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:15,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:15,093 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:15,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:15,104 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:15,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:15,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,121 INFO L229 MonitoredProcess]: Starting monitored process 70 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:15,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-02-21 04:35:15,153 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:15,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:15,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:15,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:15,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:15,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:15,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:15,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:15,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2022-02-21 04:35:15,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,180 INFO L229 MonitoredProcess]: Starting monitored process 71 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:15,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-02-21 04:35:15,182 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:15,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:15,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:15,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:15,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:15,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:15,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:15,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:15,190 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:15,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:15,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,207 INFO L229 MonitoredProcess]: Starting monitored process 72 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:15,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-02-21 04:35:15,209 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:15,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:15,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:15,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:15,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:15,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:15,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:15,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:15,216 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:15,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2022-02-21 04:35:15,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,233 INFO L229 MonitoredProcess]: Starting monitored process 73 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:15,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-02-21 04:35:15,236 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:15,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:15,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:15,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:15,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:15,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:15,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:15,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:15,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:15,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-02-21 04:35:15,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,260 INFO L229 MonitoredProcess]: Starting monitored process 74 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:15,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-02-21 04:35:15,262 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:15,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:15,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:15,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:15,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:15,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:15,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:15,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:15,270 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:15,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2022-02-21 04:35:15,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,321 INFO L229 MonitoredProcess]: Starting monitored process 75 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:15,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-02-21 04:35:15,324 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:15,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:15,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:15,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:15,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:15,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:15,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:15,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:15,331 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:15,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2022-02-21 04:35:15,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,348 INFO L229 MonitoredProcess]: Starting monitored process 76 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:15,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-02-21 04:35:15,351 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:15,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:15,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:15,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:15,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:15,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:15,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:15,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:15,358 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:15,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-02-21 04:35:15,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,374 INFO L229 MonitoredProcess]: Starting monitored process 77 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:15,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-02-21 04:35:15,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:15,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:15,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:15,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:15,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:15,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:15,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:15,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:15,383 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:15,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2022-02-21 04:35:15,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,400 INFO L229 MonitoredProcess]: Starting monitored process 78 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:15,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-02-21 04:35:15,402 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:15,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:15,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:15,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:15,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:15,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:15,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:15,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:15,409 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:15,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2022-02-21 04:35:15,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,425 INFO L229 MonitoredProcess]: Starting monitored process 79 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:15,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-02-21 04:35:15,427 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:15,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:15,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:15,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:15,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:15,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:15,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:15,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:15,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:15,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2022-02-21 04:35:15,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,451 INFO L229 MonitoredProcess]: Starting monitored process 80 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:15,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-02-21 04:35:15,453 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:15,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:15,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:15,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:15,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:15,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:15,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:15,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:15,460 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:15,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:15,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,476 INFO L229 MonitoredProcess]: Starting monitored process 81 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:15,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-02-21 04:35:15,478 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:15,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:15,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:15,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:15,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:15,486 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:15,486 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:15,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:15,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-02-21 04:35:15,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,512 INFO L229 MonitoredProcess]: Starting monitored process 82 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:15,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-02-21 04:35:15,537 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:15,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:15,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:15,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:15,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:15,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:15,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:15,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:15,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:15,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2022-02-21 04:35:15,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,561 INFO L229 MonitoredProcess]: Starting monitored process 83 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:15,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-02-21 04:35:15,563 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:15,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:15,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:15,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:15,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:15,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:15,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:15,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:15,570 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:15,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:15,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,587 INFO L229 MonitoredProcess]: Starting monitored process 84 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:15,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-02-21 04:35:15,589 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:15,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:15,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:15,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:15,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:15,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:15,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:15,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:15,596 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:15,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:15,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,612 INFO L229 MonitoredProcess]: Starting monitored process 85 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:15,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-02-21 04:35:15,614 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:15,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:15,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:15,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:15,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:15,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:15,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:15,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:15,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:15,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2022-02-21 04:35:15,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,653 INFO L229 MonitoredProcess]: Starting monitored process 86 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:15,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-02-21 04:35:15,656 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:15,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:15,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:15,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:15,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:15,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:15,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:15,692 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:15,755 INFO L443 ModelExtractionUtils]: Simplification made 27 calls to the SMT solver. [2022-02-21 04:35:15,756 INFO L444 ModelExtractionUtils]: 8 out of 64 variables were initially zero. Simplification set additionally 53 variables to zero. [2022-02-21 04:35:15,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,757 INFO L229 MonitoredProcess]: Starting monitored process 87 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:15,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-02-21 04:35:15,759 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:15,765 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:15,766 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:15,766 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_5, ULTIMATE.start_cstrcspn_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_5 - 1*ULTIMATE.start_cstrcspn_~s~0#1.offset Supporting invariants [] [2022-02-21 04:35:15,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:15,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:16,061 INFO L297 tatePredicateManager]: 54 out of 55 supporting invariants were superfluous and have been removed [2022-02-21 04:35:16,066 INFO L390 LassoCheck]: Loop: "call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1;" "assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256);" "assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset;" [2022-02-21 04:35:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:16,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:16,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 04:35:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:16,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:16,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {3131#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {3131#unseeded} is VALID [2022-02-21 04:35:16,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {3131#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {3131#unseeded} is VALID [2022-02-21 04:35:16,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {3131#unseeded} assume !(main_~length1~0#1 < 1); {3131#unseeded} is VALID [2022-02-21 04:35:16,257 INFO L290 TraceCheckUtils]: 3: Hoare triple {3131#unseeded} assume !(main_~length2~0#1 < 1); {3131#unseeded} is VALID [2022-02-21 04:35:16,257 INFO L290 TraceCheckUtils]: 4: Hoare triple {3131#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {3441#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {3441#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {3441#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {3441#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {3441#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {3441#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {3441#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {3441#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {3441#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {3441#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {3441#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {3441#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} main_~i~1#1 := 0; {3441#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {3441#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; {3441#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {3441#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {3441#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {3441#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {3441#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {3441#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; {3472#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {3472#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {3472#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {3472#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; {3472#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {3472#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; {3472#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {3472#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); {3472#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {3472#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; {3472#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {3472#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); {3472#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {3472#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; {3472#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {3472#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; {3472#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {3472#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {3472#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {3472#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; {3420#(and unseeded (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:16,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:35:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:16,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:16,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {3421#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|))) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; {3503#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {3503#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); {3503#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {3503#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; {3423#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|))))) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,321 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:16,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:16,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:16,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,338 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2022-02-21 04:35:16,339 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:16,412 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 56 states and 70 transitions. Complement of second has 7 states. [2022-02-21 04:35:16,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:16,412 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:16,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. cyclomatic complexity: 15 [2022-02-21 04:35:16,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:16,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:16,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:16,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:16,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:16,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:16,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 70 transitions. [2022-02-21 04:35:16,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:16,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:16,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:16,414 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 48 transitions. cyclomatic complexity: 15 [2022-02-21 04:35:16,414 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:35:16,414 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:16,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:16,415 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:16,415 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 56 states and 70 transitions. cyclomatic complexity: 19 [2022-02-21 04:35:16,416 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:35:16,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:16,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:16,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:16,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 56 letters. Loop has 56 letters. [2022-02-21 04:35:16,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 56 letters. [2022-02-21 04:35:16,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 56 letters. Loop has 56 letters. [2022-02-21 04:35:16,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 38 letters. Loop has 38 letters. [2022-02-21 04:35:16,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 38 letters. [2022-02-21 04:35:16,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 38 letters. Loop has 38 letters. [2022-02-21 04:35:16,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:16,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:16,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:16,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 26 letters. Loop has 3 letters. [2022-02-21 04:35:16,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 3 letters. [2022-02-21 04:35:16,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 26 letters. Loop has 3 letters. [2022-02-21 04:35:16,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 27 letters. Loop has 3 letters. [2022-02-21 04:35:16,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 3 letters. [2022-02-21 04:35:16,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 27 letters. Loop has 3 letters. [2022-02-21 04:35:16,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:16,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:16,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:16,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 27 letters. Loop has 3 letters. [2022-02-21 04:35:16,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 3 letters. [2022-02-21 04:35:16,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 27 letters. Loop has 3 letters. [2022-02-21 04:35:16,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 26 letters. Loop has 3 letters. [2022-02-21 04:35:16,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 3 letters. [2022-02-21 04:35:16,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 26 letters. Loop has 3 letters. [2022-02-21 04:35:16,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,434 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:16,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:16,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-02-21 04:35:16,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,435 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:35:16,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:16,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 04:35:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:16,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:16,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {3131#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {3131#unseeded} is VALID [2022-02-21 04:35:16,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {3131#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {3131#unseeded} is VALID [2022-02-21 04:35:16,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {3131#unseeded} assume !(main_~length1~0#1 < 1); {3131#unseeded} is VALID [2022-02-21 04:35:16,599 INFO L290 TraceCheckUtils]: 3: Hoare triple {3131#unseeded} assume !(main_~length2~0#1 < 1); {3131#unseeded} is VALID [2022-02-21 04:35:16,600 INFO L290 TraceCheckUtils]: 4: Hoare triple {3131#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {3596#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {3596#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {3596#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {3596#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {3596#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {3596#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {3596#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {3596#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {3596#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {3596#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {3596#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {3596#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} main_~i~1#1 := 0; {3596#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {3596#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; {3596#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {3596#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {3596#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {3596#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {3596#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {3596#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; {3627#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {3627#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {3627#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {3627#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; {3627#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {3627#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; {3627#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {3627#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); {3627#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {3627#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; {3627#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {3627#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); {3627#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {3627#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; {3627#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {3627#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; {3627#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {3627#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {3627#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {3627#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; {3420#(and unseeded (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:16,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:35:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:16,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:16,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {3421#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|))) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; {3658#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {3658#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); {3658#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {3658#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; {3423#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|))))) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,653 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:16,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:16,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:16,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,668 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2022-02-21 04:35:16,668 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:16,759 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 56 states and 70 transitions. Complement of second has 7 states. [2022-02-21 04:35:16,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:16,760 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:16,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. cyclomatic complexity: 15 [2022-02-21 04:35:16,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:16,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:16,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:16,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:16,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:16,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:16,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 70 transitions. [2022-02-21 04:35:16,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:16,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:16,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:16,761 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 48 transitions. cyclomatic complexity: 15 [2022-02-21 04:35:16,761 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:35:16,762 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:16,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:16,762 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:16,762 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 56 states and 70 transitions. cyclomatic complexity: 19 [2022-02-21 04:35:16,762 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:35:16,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:16,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:16,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:16,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 56 letters. Loop has 56 letters. [2022-02-21 04:35:16,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 56 letters. [2022-02-21 04:35:16,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 56 letters. Loop has 56 letters. [2022-02-21 04:35:16,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 38 letters. Loop has 38 letters. [2022-02-21 04:35:16,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 38 letters. [2022-02-21 04:35:16,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 38 letters. Loop has 38 letters. [2022-02-21 04:35:16,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:16,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:16,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:16,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 26 letters. Loop has 3 letters. [2022-02-21 04:35:16,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 3 letters. [2022-02-21 04:35:16,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 26 letters. Loop has 3 letters. [2022-02-21 04:35:16,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 27 letters. Loop has 3 letters. [2022-02-21 04:35:16,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 3 letters. [2022-02-21 04:35:16,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 27 letters. Loop has 3 letters. [2022-02-21 04:35:16,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:16,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:16,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:16,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 26 letters. Loop has 3 letters. [2022-02-21 04:35:16,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 3 letters. [2022-02-21 04:35:16,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 26 letters. Loop has 3 letters. [2022-02-21 04:35:16,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 27 letters. Loop has 3 letters. [2022-02-21 04:35:16,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 3 letters. [2022-02-21 04:35:16,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 70 transitions. cyclomatic complexity: 19 Stem has 27 letters. Loop has 3 letters. [2022-02-21 04:35:16,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,769 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:16,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-02-21 04:35:16,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,770 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:35:16,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:16,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 04:35:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:16,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:16,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {3131#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {3131#unseeded} is VALID [2022-02-21 04:35:16,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {3131#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {3131#unseeded} is VALID [2022-02-21 04:35:16,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {3131#unseeded} assume !(main_~length1~0#1 < 1); {3131#unseeded} is VALID [2022-02-21 04:35:16,925 INFO L290 TraceCheckUtils]: 3: Hoare triple {3131#unseeded} assume !(main_~length2~0#1 < 1); {3131#unseeded} is VALID [2022-02-21 04:35:16,925 INFO L290 TraceCheckUtils]: 4: Hoare triple {3131#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {3751#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {3751#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {3751#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {3751#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {3751#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {3751#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {3751#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {3751#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {3751#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {3751#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {3751#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {3751#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} main_~i~1#1 := 0; {3751#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {3751#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; {3751#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {3751#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {3751#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {3751#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {3751#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {3751#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; {3782#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {3782#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {3782#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {3782#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; {3782#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {3782#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; {3782#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {3782#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); {3782#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {3782#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; {3782#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {3782#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); {3782#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {3782#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; {3782#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {3782#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; {3782#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {3782#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {3782#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {3782#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; {3420#(and unseeded (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:16,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:35:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:16,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:16,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {3421#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|))) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; {3813#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {3813#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); {3813#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {3813#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; {3423#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|))))) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:16,974 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:16,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:16,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:16,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:16,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:16,988 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2022-02-21 04:35:16,988 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:17,077 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 55 states and 72 transitions. Complement of second has 6 states. [2022-02-21 04:35:17,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:17,077 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:17,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. cyclomatic complexity: 15 [2022-02-21 04:35:17,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:17,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:17,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:17,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:17,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:17,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:17,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 72 transitions. [2022-02-21 04:35:17,078 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:17,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:17,078 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 48 transitions. cyclomatic complexity: 15 [2022-02-21 04:35:17,078 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:35:17,079 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:17,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:17,079 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:17,079 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 55 states and 72 transitions. cyclomatic complexity: 22 [2022-02-21 04:35:17,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 72 transitions. cyclomatic complexity: 22 [2022-02-21 04:35:17,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:17,079 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:35:17,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:17,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:17,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 72 transitions. cyclomatic complexity: 22 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:17,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:17,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:17,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 72 transitions. cyclomatic complexity: 22 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:17,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 55 letters. Loop has 55 letters. [2022-02-21 04:35:17,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 55 letters. [2022-02-21 04:35:17,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 72 transitions. cyclomatic complexity: 22 Stem has 55 letters. Loop has 55 letters. [2022-02-21 04:35:17,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 38 letters. Loop has 38 letters. [2022-02-21 04:35:17,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 38 letters. [2022-02-21 04:35:17,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 72 transitions. cyclomatic complexity: 22 Stem has 38 letters. Loop has 38 letters. [2022-02-21 04:35:17,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:17,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:17,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 72 transitions. cyclomatic complexity: 22 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:17,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 26 letters. Loop has 3 letters. [2022-02-21 04:35:17,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 3 letters. [2022-02-21 04:35:17,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 72 transitions. cyclomatic complexity: 22 Stem has 26 letters. Loop has 3 letters. [2022-02-21 04:35:17,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 27 letters. Loop has 3 letters. [2022-02-21 04:35:17,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 3 letters. [2022-02-21 04:35:17,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 72 transitions. cyclomatic complexity: 22 Stem has 27 letters. Loop has 3 letters. [2022-02-21 04:35:17,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:17,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:17,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 72 transitions. cyclomatic complexity: 22 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:17,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:17,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:17,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 72 transitions. cyclomatic complexity: 22 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:17,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,082 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:17,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:17,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-02-21 04:35:17,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:35:17,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 28 letters. Loop has 3 letters. [2022-02-21 04:35:17,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 25 letters. Loop has 6 letters. [2022-02-21 04:35:17,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 72 transitions. cyclomatic complexity: 22 [2022-02-21 04:35:17,084 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:17,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. [2022-02-21 04:35:17,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:35:17,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:35:17,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:35:17,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:17,085 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:17,085 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:17,085 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:17,085 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2022-02-21 04:35:17,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:35:17,085 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:17,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:17,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:35:17 BoogieIcfgContainer [2022-02-21 04:35:17,089 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:35:17,089 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:35:17,089 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:35:17,090 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:35:17,090 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:53" (3/4) ... [2022-02-21 04:35:17,091 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:35:17,091 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:35:17,092 INFO L158 Benchmark]: Toolchain (without parser) took 24370.22ms. Allocated memory was 88.1MB in the beginning and 197.1MB in the end (delta: 109.1MB). Free memory was 53.3MB in the beginning and 115.0MB in the end (delta: -61.7MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2022-02-21 04:35:17,092 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 88.1MB. Free memory was 58.3MB in the beginning and 58.3MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:17,093 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.00ms. Allocated memory is still 88.1MB. Free memory was 53.1MB in the beginning and 56.7MB in the end (delta: -3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 04:35:17,093 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.43ms. Allocated memory is still 88.1MB. Free memory was 56.7MB in the beginning and 54.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:17,093 INFO L158 Benchmark]: Boogie Preprocessor took 30.64ms. Allocated memory is still 88.1MB. Free memory was 54.2MB in the beginning and 52.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:17,093 INFO L158 Benchmark]: RCFGBuilder took 432.30ms. Allocated memory is still 88.1MB. Free memory was 52.5MB in the beginning and 37.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 04:35:17,093 INFO L158 Benchmark]: BuchiAutomizer took 23480.41ms. Allocated memory was 88.1MB in the beginning and 197.1MB in the end (delta: 109.1MB). Free memory was 37.5MB in the beginning and 115.0MB in the end (delta: -77.6MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2022-02-21 04:35:17,093 INFO L158 Benchmark]: Witness Printer took 2.13ms. Allocated memory is still 197.1MB. Free memory is still 115.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:17,094 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 88.1MB. Free memory was 58.3MB in the beginning and 58.3MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.00ms. Allocated memory is still 88.1MB. Free memory was 53.1MB in the beginning and 56.7MB in the end (delta: -3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.43ms. Allocated memory is still 88.1MB. Free memory was 56.7MB in the beginning and 54.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.64ms. Allocated memory is still 88.1MB. Free memory was 54.2MB in the beginning and 52.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 432.30ms. Allocated memory is still 88.1MB. Free memory was 52.5MB in the beginning and 37.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 23480.41ms. Allocated memory was 88.1MB in the beginning and 197.1MB in the end (delta: 109.1MB). Free memory was 37.5MB in the beginning and 115.0MB in the end (delta: -77.6MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. * Witness Printer took 2.13ms. Allocated memory is still 197.1MB. Free memory is still 115.0MB. 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 10 terminating modules (5 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + -1 * nondetString1 + unknown-#length-unknown[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 -1 * sc1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 4 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[nondetString2] and consists of 5 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 23.4s and 11 iterations. TraceHistogramMax:2. Analysis of lassos took 19.0s. Construction of modules took 0.6s. Büchi inclusion checks took 3.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 92 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 40 states and ocurred in iteration 4. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 634 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 634 mSDsluCounter, 810 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 594 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 614 IncrementalHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 216 mSDtfsCounter, 614 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU2 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital273 mio100 ax108 hnf100 lsp88 ukn76 mio100 lsp48 div104 bol100 ite100 ukn100 eq178 hnf90 smp94 dnf373 smp73 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:35:17,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2022-02-21 04:35:17,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2022-02-21 04:35:17,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE