./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/substring-alloca-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/substring-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4cb6276eff0c60579b1d5f7034948eb4f53891709ff48cdd11b3329ec3c4cc2e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:35:42,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:35:42,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:35:42,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:35:42,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:35:42,181 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:35:42,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:35:42,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:35:42,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:35:42,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:35:42,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:35:42,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:35:42,197 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:35:42,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:35:42,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:35:42,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:35:42,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:35:42,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:35:42,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:35:42,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:35:42,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:35:42,216 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:35:42,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:35:42,218 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:35:42,221 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:35:42,221 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:35:42,221 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:35:42,222 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:35:42,222 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:35:42,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:35:42,223 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:35:42,224 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:35:42,225 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:35:42,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:35:42,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:35:42,226 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:35:42,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:35:42,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:35:42,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:35:42,227 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:35:42,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:35:42,228 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:35:42,258 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:35:42,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:35:42,259 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:35:42,259 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:35:42,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:35:42,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:35:42,262 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:35:42,262 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:35:42,262 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:35:42,262 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:35:42,263 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:35:42,263 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:35:42,264 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:35:42,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:35:42,264 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:35:42,264 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:35:42,264 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:35:42,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:35:42,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:35:42,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:35:42,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:35:42,265 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:35:42,265 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:35:42,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:35:42,267 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:35:42,267 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:35:42,267 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:35:42,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:35:42,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:35:42,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:35:42,268 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:35:42,270 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:35:42,270 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 -> 4cb6276eff0c60579b1d5f7034948eb4f53891709ff48cdd11b3329ec3c4cc2e [2022-02-21 04:35:42,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:35:42,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:35:42,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:35:42,552 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:35:42,553 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:35:42,554 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2022-02-21 04:35:42,628 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/099fd3771/1d6834b74b1145a7bada06d051dec6ad/FLAG109e23ebe [2022-02-21 04:35:43,039 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:35:43,040 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2022-02-21 04:35:43,051 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/099fd3771/1d6834b74b1145a7bada06d051dec6ad/FLAG109e23ebe [2022-02-21 04:35:43,427 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/099fd3771/1d6834b74b1145a7bada06d051dec6ad [2022-02-21 04:35:43,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:35:43,431 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:35:43,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:43,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:35:43,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:35:43,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:43" (1/1) ... [2022-02-21 04:35:43,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c0171b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:43, skipping insertion in model container [2022-02-21 04:35:43,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:43" (1/1) ... [2022-02-21 04:35:43,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:35:43,498 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:35:43,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:43,787 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:35:43,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:43,845 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:35:43,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:43 WrapperNode [2022-02-21 04:35:43,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:43,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:43,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:35:43,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:35:43,853 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:35:43" (1/1) ... [2022-02-21 04:35:43,866 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:35:43" (1/1) ... [2022-02-21 04:35:43,888 INFO L137 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2022-02-21 04:35:43,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:43,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:35:43,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:35:43,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:35:43,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:43" (1/1) ... [2022-02-21 04:35:43,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:43" (1/1) ... [2022-02-21 04:35:43,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:43" (1/1) ... [2022-02-21 04:35:43,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:43" (1/1) ... [2022-02-21 04:35:43,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:43" (1/1) ... [2022-02-21 04:35:43,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:43" (1/1) ... [2022-02-21 04:35:43,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:43" (1/1) ... [2022-02-21 04:35:43,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:35:43,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:35:43,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:35:43,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:35:43,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:43" (1/1) ... [2022-02-21 04:35:43,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:43,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:43,986 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:35:43,998 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:35:44,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:35:44,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:35:44,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:35:44,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:35:44,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:35:44,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:35:44,104 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:35:44,105 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:35:44,287 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:35:44,293 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:35:44,293 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-21 04:35:44,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:44 BoogieIcfgContainer [2022-02-21 04:35:44,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:35:44,295 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:35:44,295 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:35:44,298 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:35:44,299 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:44,299 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:35:43" (1/3) ... [2022-02-21 04:35:44,300 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@382ebb8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:44, skipping insertion in model container [2022-02-21 04:35:44,300 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:44,300 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:43" (2/3) ... [2022-02-21 04:35:44,300 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@382ebb8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:44, skipping insertion in model container [2022-02-21 04:35:44,301 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:44,301 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:44" (3/3) ... [2022-02-21 04:35:44,302 INFO L388 chiAutomizerObserver]: Analyzing ICFG substring-alloca-2.i [2022-02-21 04:35:44,337 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:35:44,338 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:35:44,338 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:35:44,338 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:35:44,338 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:35:44,338 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:35:44,338 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:35:44,339 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:35:44,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have 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:44,382 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-02-21 04:35:44,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:44,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:44,388 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:44,389 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:44,389 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:35:44,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have 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:44,398 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-02-21 04:35:44,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:44,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:44,399 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:44,399 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:44,406 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; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1, 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~nondet11#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 11#L532true assume !(main_~length1~0#1 < 1); 8#L532-2true assume !(main_~length2~0#1 < 1); 3#L535-1true call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 18#L541-3true [2022-02-21 04:35:44,407 INFO L793 eck$LassoCheckResult]: Loop: 18#L541-3true assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet16#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; 23#L541-2true main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 18#L541-3true [2022-02-21 04:35:44,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:44,412 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 04:35:44,419 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:44,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108127634] [2022-02-21 04:35:44,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:44,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:44,508 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:44,536 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:44,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:44,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-02-21 04:35:44,539 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:44,539 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976020619] [2022-02-21 04:35:44,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:44,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:44,558 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:44,567 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:44,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:44,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-02-21 04:35:44,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:44,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174182117] [2022-02-21 04:35:44,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:44,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:44,634 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:44,662 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:45,057 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:45,058 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:45,058 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:45,058 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:45,059 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:45,059 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:45,059 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:45,060 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:45,060 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration1_Lasso [2022-02-21 04:35:45,060 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:45,060 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:45,080 INFO L141 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:45,085 INFO L141 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:45,088 INFO L141 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:45,091 INFO L141 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:45,093 INFO L141 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:45,099 INFO L141 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:45,103 INFO L141 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:45,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:45,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:45,340 INFO L141 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:45,344 INFO L141 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:45,349 INFO L141 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:45,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:45,358 INFO L141 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:45,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:45,756 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:45,759 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:45,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:45,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:45,777 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:35:45,781 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:35:45,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:45,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:45,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:45,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:45,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:45,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:45,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:45,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:45,798 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:45,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 04:35:45,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:45,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:45,827 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:35:45,830 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:35:45,831 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:45,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:45,838 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:45,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:45,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:45,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:45,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:45,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:45,855 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:45,875 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:35:45,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:45,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:45,877 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:35:45,879 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:35:45,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:45,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:45,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:45,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:45,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:45,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:45,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:45,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:45,902 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:45,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:45,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:45,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:45,930 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:35:45,931 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:35:45,933 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:45,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:45,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:45,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:45,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:45,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:45,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:45,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:45,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:45,976 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:35:45,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:45,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:45,978 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:45,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:35:45,980 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:45,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:45,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:45,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:45,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:45,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:45,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:46,002 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:46,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:46,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:46,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:46,021 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:46,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:35:46,024 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:46,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:46,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:46,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:46,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:46,033 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:46,033 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:46,037 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:46,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:46,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:46,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:46,055 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:46,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:35:46,058 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:46,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:46,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:46,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:46,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:46,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:46,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:46,081 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:46,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 04:35:46,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:46,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:46,099 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:46,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:35:46,101 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:46,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:46,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:46,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:46,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:46,113 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:46,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:46,118 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:46,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:46,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:46,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:46,136 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:46,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:35:46,139 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:46,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:46,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:46,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:46,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:46,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:46,153 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:46,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:46,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:46,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:46,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:46,177 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:46,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 04:35:46,179 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:46,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:46,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:46,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:46,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:46,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:46,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:46,211 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:46,283 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2022-02-21 04:35:46,283 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-02-21 04:35:46,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:46,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:46,296 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:46,360 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:46,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 04:35:46,380 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 04:35:46,380 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:46,388 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [1*ULTIMATE.start_main_~nondetString1~0#1.offset >= 0] [2022-02-21 04:35:46,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:46,446 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:35:46,488 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2022-02-21 04:35:46,498 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet16#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;" "main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1;" [2022-02-21 04:35:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:46,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:46,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:46,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:46,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {33#unseeded} is VALID [2022-02-21 04:35:46,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1, 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~nondet11#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {33#unseeded} is VALID [2022-02-21 04:35:46,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#unseeded} assume !(main_~length1~0#1 < 1); {33#unseeded} is VALID [2022-02-21 04:35:46,600 INFO L290 TraceCheckUtils]: 3: Hoare triple {33#unseeded} assume !(main_~length2~0#1 < 1); {33#unseeded} is VALID [2022-02-21 04:35:46,601 INFO L290 TraceCheckUtils]: 4: Hoare triple {33#unseeded} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {82#(and unseeded (>= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:46,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 04:35:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:46,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:46,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {83#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |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~nondet16#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; {103#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~i~0#1| 1) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (>= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:46,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {103#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~i~0#1| 1) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (>= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {85#(and (>= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))))} is VALID [2022-02-21 04:35:46,661 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:46,691 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:35:46,701 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:35:46,703 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:35:46,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,707 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:35:46,709 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 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:35:46,890 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 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 57 states and 84 transitions. Complement of second has 7 states. [2022-02-21 04:35:46,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:46,895 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:46,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have 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:46,898 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-02-21 04:35:46,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:46,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:46,901 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:35:46,905 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:46,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:46,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:46,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 84 transitions. [2022-02-21 04:35:46,914 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 04:35:46,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:46,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:46,917 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have 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:46,923 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-02-21 04:35:46,927 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 11 examples of accepted words. [2022-02-21 04:35:46,928 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:35:46,932 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:46,934 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:46,934 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 57 states and 84 transitions. cyclomatic complexity: 34 [2022-02-21 04:35:46,937 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 04:35:46,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:35:46,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,940 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:35:46,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:46,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:46,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,942 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:35:46,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:46,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:46,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,943 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:35:46,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:46,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 57 letters. [2022-02-21 04:35:46,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,945 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 57 letters. Loop has 57 letters. [2022-02-21 04:35:46,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 57 letters. Loop has 57 letters. [2022-02-21 04:35:46,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 23 letters. [2022-02-21 04:35:46,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,950 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 23 letters. Loop has 23 letters. [2022-02-21 04:35:46,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 23 letters. Loop has 23 letters. [2022-02-21 04:35:46,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:46,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,951 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:35:46,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:46,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:46,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,952 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:35:46,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:46,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 04:35:46,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,954 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 5 letters. [2022-02-21 04:35:46,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 12 letters. Loop has 5 letters. [2022-02-21 04:35:46,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 04:35:46,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,956 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 5 letters. [2022-02-21 04:35:46,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:46,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:46,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,958 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:35:46,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:46,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 04:35:46,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,960 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 5 letters. [2022-02-21 04:35:46,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 5 letters. [2022-02-21 04:35:46,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:46,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,961 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:35:46,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:46,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:35:46,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,962 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 5 letters. [2022-02-21 04:35:46,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:35:46,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:46,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,964 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:35:46,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:46,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:46,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,967 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:35:46,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:46,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:35:46,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,969 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:35:46,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:46,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:46,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,970 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:35:46,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:46,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:46,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,971 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:35:46,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:46,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:46,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,973 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:35:46,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:46,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 7 letters. [2022-02-21 04:35:46,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,974 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 7 letters. [2022-02-21 04:35:46,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 7 letters. [2022-02-21 04:35:46,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:46,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,976 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:35:46,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:46,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:46,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,977 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:35:46,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:46,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 7 letters. [2022-02-21 04:35:46,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,979 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 7 letters. [2022-02-21 04:35:46,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 14 letters. Loop has 7 letters. [2022-02-21 04:35:46,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 7 letters. [2022-02-21 04:35:46,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,980 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 7 letters. [2022-02-21 04:35:46,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 7 letters. [2022-02-21 04:35:46,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 7 letters. [2022-02-21 04:35:46,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,981 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 7 letters. [2022-02-21 04:35:46,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 7 letters. [2022-02-21 04:35:46,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:46,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,982 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:35:46,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:46,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:46,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,983 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:35:46,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:46,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:46,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,984 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:35:46,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:46,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,985 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:46,990 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:35:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-02-21 04:35:46,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:46,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:46,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:35:46,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:46,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 84 transitions. cyclomatic complexity: 34 [2022-02-21 04:35:47,000 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 04:35:47,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 19 states and 26 transitions. [2022-02-21 04:35:47,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 04:35:47,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-02-21 04:35:47,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2022-02-21 04:35:47,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:47,005 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 04:35:47,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2022-02-21 04:35:47,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-21 04:35:47,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:47,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 26 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:47,027 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 26 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:47,029 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:47,033 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2022-02-21 04:35:47,033 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2022-02-21 04:35:47,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:47,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:47,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 26 transitions. [2022-02-21 04:35:47,034 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 26 transitions. [2022-02-21 04:35:47,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:47,035 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2022-02-21 04:35:47,036 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2022-02-21 04:35:47,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:47,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:47,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:47,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:47,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2022-02-21 04:35:47,038 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 04:35:47,038 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 04:35:47,038 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:35:47,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2022-02-21 04:35:47,039 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 04:35:47,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:47,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:47,040 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:47,040 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:47,040 INFO L791 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 180#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1, 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~nondet11#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 185#L532 assume !(main_~length1~0#1 < 1); 184#L532-2 assume !(main_~length2~0#1 < 1); 175#L535-1 call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 176#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 187#L541-4 main_~i~1#1 := 0; 178#L547-3 [2022-02-21 04:35:47,040 INFO L793 eck$LassoCheckResult]: Loop: 178#L547-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet18#1; 177#L547-2 main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 178#L547-3 [2022-02-21 04:35:47,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:47,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2022-02-21 04:35:47,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:47,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962718936] [2022-02-21 04:35:47,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:47,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:47,056 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:47,067 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:47,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:47,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2022-02-21 04:35:47,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:47,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588838910] [2022-02-21 04:35:47,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:47,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:47,080 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:47,086 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:47,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:47,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2022-02-21 04:35:47,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:47,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886883965] [2022-02-21 04:35:47,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:47,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:47,139 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:47,157 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:47,432 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:47,432 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:47,432 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:47,432 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:47,432 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:47,432 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:47,432 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:47,432 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:47,432 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration2_Lasso [2022-02-21 04:35:47,433 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:47,433 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:47,435 INFO L141 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:47,438 INFO L141 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:47,441 INFO L141 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:47,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:35:47,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:35:47,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:35:47,455 INFO L141 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:47,458 INFO L141 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:47,460 INFO L141 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:47,636 INFO L141 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:47,639 INFO L141 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:47,642 INFO L141 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:47,645 INFO L141 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:47,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:47,978 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:47,979 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:47,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:47,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:47,981 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:47,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 04:35:47,989 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:47,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:47,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:47,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:47,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:47,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:47,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:47,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:48,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:48,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-02-21 04:35:48,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:48,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:48,026 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:48,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:35:48,028 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:48,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:48,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:48,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:48,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:48,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:48,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:48,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:48,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:48,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:48,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:48,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:48,052 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:48,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:35:48,054 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:48,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:48,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:48,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:48,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:48,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:48,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:48,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:48,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:48,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:48,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:48,105 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:48,114 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:48,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:48,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:48,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:48,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:48,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:48,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:48,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:48,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:35:48,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:48,152 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:35:48,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:48,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:48,153 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:48,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:35:48,157 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:48,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:48,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:48,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:48,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:48,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:48,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:48,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:48,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:48,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:48,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:48,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:48,184 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:48,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:35:48,188 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:48,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:48,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:48,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:48,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:48,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:48,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:48,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:48,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:48,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:48,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:48,236 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:48,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:35:48,238 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:48,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:48,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:48,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:48,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:48,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:48,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:48,259 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:48,287 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:35:48,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:48,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:48,288 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:48,292 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:48,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:35:48,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:48,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:48,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:48,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:48,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:48,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:48,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:48,314 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:48,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:48,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:48,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:48,343 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:48,348 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:48,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:48,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:48,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:48,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:48,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:48,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:48,360 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:48,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:48,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:48,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:48,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:48,401 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:48,402 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:48,403 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:48,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:48,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:48,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:48,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:48,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:48,415 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:48,431 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:48,445 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-02-21 04:35:48,445 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-02-21 04:35:48,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:48,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:48,472 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:48,474 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:48,474 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:48,500 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:48,501 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:48,501 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~length2~0#1) = -1*ULTIMATE.start_main_~i~1#1 + 1*ULTIMATE.start_main_~length2~0#1 Supporting invariants [] [2022-02-21 04:35:48,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:48,550 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 04:35:48,554 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet18#1;" "main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" [2022-02-21 04:35:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:48,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:48,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:35:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:48,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:48,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {241#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {241#unseeded} is VALID [2022-02-21 04:35:48,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1, 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~nondet11#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {241#unseeded} is VALID [2022-02-21 04:35:48,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {241#unseeded} assume !(main_~length1~0#1 < 1); {241#unseeded} is VALID [2022-02-21 04:35:48,602 INFO L290 TraceCheckUtils]: 3: Hoare triple {241#unseeded} assume !(main_~length2~0#1 < 1); {241#unseeded} is VALID [2022-02-21 04:35:48,603 INFO L290 TraceCheckUtils]: 4: Hoare triple {241#unseeded} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {241#unseeded} is VALID [2022-02-21 04:35:48,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {241#unseeded} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {241#unseeded} is VALID [2022-02-21 04:35:48,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {241#unseeded} main_~i~1#1 := 0; {241#unseeded} is VALID [2022-02-21 04:35:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:48,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:48,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:48,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#(>= oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|)))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet18#1; {307#(and (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length2~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|))))} is VALID [2022-02-21 04:35:48,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#(and (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length2~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|))))} main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {284#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|)))) unseeded)} is VALID [2022-02-21 04:35:48,637 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:48,638 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:35:48,644 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:35:48,644 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:35:48,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,644 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:35:48,644 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 26 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:35:48,711 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 26 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 29 states and 42 transitions. Complement of second has 6 states. [2022-02-21 04:35:48,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:48,711 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:48,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. cyclomatic complexity: 10 [2022-02-21 04:35:48,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:48,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:48,713 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:35:48,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:48,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:48,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:48,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 42 transitions. [2022-02-21 04:35:48,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:35:48,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:48,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:48,721 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 26 transitions. cyclomatic complexity: 10 [2022-02-21 04:35:48,726 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 04:35:48,726 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:35:48,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:48,727 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:48,727 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 42 transitions. cyclomatic complexity: 17 [2022-02-21 04:35:48,732 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 04:35:48,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:48,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,734 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:35:48,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:48,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:48,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,736 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:35:48,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:48,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 7 letters. [2022-02-21 04:35:48,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,737 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 7 letters. [2022-02-21 04:35:48,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 7 letters. [2022-02-21 04:35:48,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 29 letters. Loop has 29 letters. [2022-02-21 04:35:48,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,740 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 29 letters. Loop has 29 letters. [2022-02-21 04:35:48,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 29 letters. Loop has 29 letters. [2022-02-21 04:35:48,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:35:48,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,741 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 19 letters. Loop has 19 letters. [2022-02-21 04:35:48,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:35:48,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:48,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,741 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:35:48,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:48,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:48,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,742 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:35:48,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:48,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 7 letters. [2022-02-21 04:35:48,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,743 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 7 letters. [2022-02-21 04:35:48,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 7 letters. [2022-02-21 04:35:48,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:48,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,744 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:35:48,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:48,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 7 letters. [2022-02-21 04:35:48,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,745 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 7 letters. [2022-02-21 04:35:48,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 7 letters. [2022-02-21 04:35:48,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 7 letters. [2022-02-21 04:35:48,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,746 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 7 letters. [2022-02-21 04:35:48,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 15 letters. Loop has 7 letters. [2022-02-21 04:35:48,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 7 letters. [2022-02-21 04:35:48,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,747 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 7 letters. [2022-02-21 04:35:48,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 7 letters. [2022-02-21 04:35:48,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:48,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,748 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:35:48,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:48,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:48,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,749 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:35:48,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:48,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:48,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,749 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:35:48,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:48,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:48,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,750 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:35:48,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:48,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 7 letters. [2022-02-21 04:35:48,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,751 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 7 letters. [2022-02-21 04:35:48,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 7 letters. [2022-02-21 04:35:48,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:48,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,752 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:35:48,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:48,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:48,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,753 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:35:48,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:48,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:48,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,754 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:35:48,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:48,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 7 letters. [2022-02-21 04:35:48,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,754 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 7 letters. [2022-02-21 04:35:48,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 7 letters. [2022-02-21 04:35:48,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 7 letters. [2022-02-21 04:35:48,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,755 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 7 letters. [2022-02-21 04:35:48,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 15 letters. Loop has 7 letters. [2022-02-21 04:35:48,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 7 letters. [2022-02-21 04:35:48,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,756 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 7 letters. [2022-02-21 04:35:48,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 7 letters. [2022-02-21 04:35:48,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,757 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:48,758 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:35:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-21 04:35:48,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:48,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:48,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:35:48,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:48,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 42 transitions. cyclomatic complexity: 17 [2022-02-21 04:35:48,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:35:48,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 20 states and 28 transitions. [2022-02-21 04:35:48,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-02-21 04:35:48,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 04:35:48,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2022-02-21 04:35:48,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:48,769 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-02-21 04:35:48,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2022-02-21 04:35:48,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-21 04:35:48,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:48,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 28 transitions. Second operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:48,771 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 28 transitions. Second operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:48,771 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:48,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:48,773 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2022-02-21 04:35:48,773 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2022-02-21 04:35:48,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:48,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:48,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 transitions. [2022-02-21 04:35:48,780 INFO L87 Difference]: Start difference. First operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 transitions. [2022-02-21 04:35:48,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:48,782 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2022-02-21 04:35:48,782 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2022-02-21 04:35:48,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:48,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:48,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:48,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:48,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2022-02-21 04:35:48,784 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-02-21 04:35:48,784 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-02-21 04:35:48,784 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:35:48,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2022-02-21 04:35:48,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:35:48,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:48,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:48,785 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:48,785 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:48,786 INFO L791 eck$LassoCheckResult]: Stem: 353#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 354#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1, 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~nondet11#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 360#L532 assume !(main_~length1~0#1 < 1); 358#L532-2 assume !(main_~length2~0#1 < 1); 349#L535-1 call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 350#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 361#L541-4 main_~i~1#1 := 0; 362#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 365#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_substring } true;substring_#in~s#1.base, substring_#in~s#1.offset, substring_#in~t#1.base, substring_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc substring_#res#1;havoc substring_#t~post7#1.base, substring_#t~post7#1.offset, substring_#t~post8#1.base, substring_#t~post8#1.offset, substring_#t~mem3#1, substring_#t~mem4#1, substring_#t~mem5#1, substring_#t~short6#1, substring_#t~mem9#1, substring_#t~post10#1.base, substring_#t~post10#1.offset, substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset, substring_#t~mem2#1, substring_~s#1.base, substring_~s#1.offset, substring_~t#1.base, substring_~t#1.offset, substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~s#1.base, substring_~s#1.offset := substring_#in~s#1.base, substring_#in~s#1.offset;substring_~t#1.base, substring_~t#1.offset := substring_#in~t#1.base, substring_#in~t#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_~s#1.base, substring_~s#1.offset; 364#L517-3 [2022-02-21 04:35:48,786 INFO L793 eck$LassoCheckResult]: Loop: 364#L517-3 call substring_#t~mem2#1 := read~int(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); 359#L517-1 assume !!(0 != substring_#t~mem2#1);havoc substring_#t~mem2#1;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_~t#1.base, substring_~t#1.offset; 357#L520-5 call substring_#t~mem3#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);substring_#t~short6#1 := 0 != substring_#t~mem3#1; 366#L520-1 assume substring_#t~short6#1;call substring_#t~mem4#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);call substring_#t~mem5#1 := read~int(substring_~ps2~0#1.base, substring_~ps2~0#1.offset, 1);substring_#t~short6#1 := substring_#t~mem4#1 == substring_#t~mem5#1; 355#L520-3 assume !substring_#t~short6#1;havoc substring_#t~mem3#1;havoc substring_#t~mem4#1;havoc substring_#t~mem5#1;havoc substring_#t~short6#1; 356#L520-6 call substring_#t~mem9#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1); 363#L524 assume !(0 == substring_#t~mem9#1);havoc substring_#t~mem9#1;substring_#t~post10#1.base, substring_#t~post10#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_#t~post10#1.base, 1 + substring_#t~post10#1.offset;havoc substring_#t~post10#1.base, substring_#t~post10#1.offset; 364#L517-3 [2022-02-21 04:35:48,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:48,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2022-02-21 04:35:48,787 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:48,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384126061] [2022-02-21 04:35:48,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:48,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:48,807 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:48,821 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:48,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:48,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 1 times [2022-02-21 04:35:48,822 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:48,822 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573275572] [2022-02-21 04:35:48,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:48,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:48,834 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:48,842 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:48,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:48,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1515359350, now seen corresponding path program 1 times [2022-02-21 04:35:48,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:48,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117947644] [2022-02-21 04:35:48,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:48,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:49,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:49,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {416#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {416#true} is VALID [2022-02-21 04:35:49,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {416#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1, 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~nondet11#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {416#true} is VALID [2022-02-21 04:35:49,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {416#true} assume !(main_~length1~0#1 < 1); {416#true} is VALID [2022-02-21 04:35:49,116 INFO L290 TraceCheckUtils]: 3: Hoare triple {416#true} assume !(main_~length2~0#1 < 1); {418#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} is VALID [2022-02-21 04:35:49,117 INFO L290 TraceCheckUtils]: 4: Hoare triple {418#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {419#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} is VALID [2022-02-21 04:35:49,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {419#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {419#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} is VALID [2022-02-21 04:35:49,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {419#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} main_~i~1#1 := 0; {420#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} is VALID [2022-02-21 04:35:49,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {420#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {421#(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:35:49,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {421#(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_substring } true;substring_#in~s#1.base, substring_#in~s#1.offset, substring_#in~t#1.base, substring_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc substring_#res#1;havoc substring_#t~post7#1.base, substring_#t~post7#1.offset, substring_#t~post8#1.base, substring_#t~post8#1.offset, substring_#t~mem3#1, substring_#t~mem4#1, substring_#t~mem5#1, substring_#t~short6#1, substring_#t~mem9#1, substring_#t~post10#1.base, substring_#t~post10#1.offset, substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset, substring_#t~mem2#1, substring_~s#1.base, substring_~s#1.offset, substring_~t#1.base, substring_~t#1.offset, substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~s#1.base, substring_~s#1.offset := substring_#in~s#1.base, substring_#in~s#1.offset;substring_~t#1.base, substring_~t#1.offset := substring_#in~t#1.base, substring_#in~t#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_~s#1.base, substring_~s#1.offset; {422#(= (select (select |#memory_int| |ULTIMATE.start_substring_~t#1.base|) |ULTIMATE.start_substring_~t#1.offset|) 0)} is VALID [2022-02-21 04:35:49,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {422#(= (select (select |#memory_int| |ULTIMATE.start_substring_~t#1.base|) |ULTIMATE.start_substring_~t#1.offset|) 0)} call substring_#t~mem2#1 := read~int(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); {422#(= (select (select |#memory_int| |ULTIMATE.start_substring_~t#1.base|) |ULTIMATE.start_substring_~t#1.offset|) 0)} is VALID [2022-02-21 04:35:49,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {422#(= (select (select |#memory_int| |ULTIMATE.start_substring_~t#1.base|) |ULTIMATE.start_substring_~t#1.offset|) 0)} assume !!(0 != substring_#t~mem2#1);havoc substring_#t~mem2#1;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_~t#1.base, substring_~t#1.offset; {423#(= (select (select |#memory_int| |ULTIMATE.start_substring_~pt~0#1.base|) |ULTIMATE.start_substring_~pt~0#1.offset|) 0)} is VALID [2022-02-21 04:35:49,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {423#(= (select (select |#memory_int| |ULTIMATE.start_substring_~pt~0#1.base|) |ULTIMATE.start_substring_~pt~0#1.offset|) 0)} call substring_#t~mem3#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);substring_#t~short6#1 := 0 != substring_#t~mem3#1; {424#(not |ULTIMATE.start_substring_#t~short6#1|)} is VALID [2022-02-21 04:35:49,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {424#(not |ULTIMATE.start_substring_#t~short6#1|)} assume substring_#t~short6#1;call substring_#t~mem4#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);call substring_#t~mem5#1 := read~int(substring_~ps2~0#1.base, substring_~ps2~0#1.offset, 1);substring_#t~short6#1 := substring_#t~mem4#1 == substring_#t~mem5#1; {417#false} is VALID [2022-02-21 04:35:49,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {417#false} assume !substring_#t~short6#1;havoc substring_#t~mem3#1;havoc substring_#t~mem4#1;havoc substring_#t~mem5#1;havoc substring_#t~short6#1; {417#false} is VALID [2022-02-21 04:35:49,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {417#false} call substring_#t~mem9#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1); {417#false} is VALID [2022-02-21 04:35:49,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {417#false} assume !(0 == substring_#t~mem9#1);havoc substring_#t~mem9#1;substring_#t~post10#1.base, substring_#t~post10#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_#t~post10#1.base, 1 + substring_#t~post10#1.offset;havoc substring_#t~post10#1.base, substring_#t~post10#1.offset; {417#false} is VALID [2022-02-21 04:35:49,124 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:49,124 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:49,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117947644] [2022-02-21 04:35:49,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117947644] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:49,125 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:49,125 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-21 04:35:49,125 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126245953] [2022-02-21 04:35:49,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:49,333 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:49,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 04:35:49,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-21 04:35:49,338 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:49,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:49,686 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-02-21 04:35:49,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 04:35:49,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:49,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:49,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2022-02-21 04:35:49,708 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2022-02-21 04:35:49,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 40 transitions. [2022-02-21 04:35:49,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-02-21 04:35:49,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-02-21 04:35:49,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2022-02-21 04:35:49,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:49,710 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-02-21 04:35:49,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2022-02-21 04:35:49,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-02-21 04:35:49,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:49,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states and 40 transitions. Second operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:49,712 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states and 40 transitions. Second operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:49,712 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:49,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:49,713 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-02-21 04:35:49,713 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-02-21 04:35:49,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:49,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:49,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states and 40 transitions. [2022-02-21 04:35:49,714 INFO L87 Difference]: Start difference. First operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states and 40 transitions. [2022-02-21 04:35:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:49,715 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-02-21 04:35:49,715 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-02-21 04:35:49,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:49,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:49,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:49,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:49,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-02-21 04:35:49,717 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-02-21 04:35:49,717 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-02-21 04:35:49,717 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:35:49,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2022-02-21 04:35:49,718 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2022-02-21 04:35:49,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:49,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:49,718 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:49,718 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:49,718 INFO L791 eck$LassoCheckResult]: Stem: 469#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 470#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1, 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~nondet11#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 478#L532 assume !(main_~length1~0#1 < 1); 475#L532-2 assume !(main_~length2~0#1 < 1); 467#L535-1 call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 468#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 479#L541-4 main_~i~1#1 := 0; 480#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 484#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_substring } true;substring_#in~s#1.base, substring_#in~s#1.offset, substring_#in~t#1.base, substring_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc substring_#res#1;havoc substring_#t~post7#1.base, substring_#t~post7#1.offset, substring_#t~post8#1.base, substring_#t~post8#1.offset, substring_#t~mem3#1, substring_#t~mem4#1, substring_#t~mem5#1, substring_#t~short6#1, substring_#t~mem9#1, substring_#t~post10#1.base, substring_#t~post10#1.offset, substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset, substring_#t~mem2#1, substring_~s#1.base, substring_~s#1.offset, substring_~t#1.base, substring_~t#1.offset, substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~s#1.base, substring_~s#1.offset := substring_#in~s#1.base, substring_#in~s#1.offset;substring_~t#1.base, substring_~t#1.offset := substring_#in~t#1.base, substring_#in~t#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_~s#1.base, substring_~s#1.offset; 482#L517-3 [2022-02-21 04:35:49,719 INFO L793 eck$LassoCheckResult]: Loop: 482#L517-3 call substring_#t~mem2#1 := read~int(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); 476#L517-1 assume !!(0 != substring_#t~mem2#1);havoc substring_#t~mem2#1;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_~t#1.base, substring_~t#1.offset; 477#L520-5 call substring_#t~mem3#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);substring_#t~short6#1 := 0 != substring_#t~mem3#1; 485#L520-1 assume !substring_#t~short6#1; 486#L520-3 assume !substring_#t~short6#1;havoc substring_#t~mem3#1;havoc substring_#t~mem4#1;havoc substring_#t~mem5#1;havoc substring_#t~short6#1; 495#L520-6 call substring_#t~mem9#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1); 481#L524 assume !(0 == substring_#t~mem9#1);havoc substring_#t~mem9#1;substring_#t~post10#1.base, substring_#t~post10#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_#t~post10#1.base, 1 + substring_#t~post10#1.offset;havoc substring_#t~post10#1.base, substring_#t~post10#1.offset; 482#L517-3 [2022-02-21 04:35:49,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:49,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 2 times [2022-02-21 04:35:49,719 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:49,719 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145233081] [2022-02-21 04:35:49,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:49,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:49,747 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:49,761 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:49,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:49,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1328800451, now seen corresponding path program 1 times [2022-02-21 04:35:49,762 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:49,762 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16813985] [2022-02-21 04:35:49,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:49,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:49,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {565#true} call substring_#t~mem2#1 := read~int(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); {565#true} is VALID [2022-02-21 04:35:49,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {565#true} assume !!(0 != substring_#t~mem2#1);havoc substring_#t~mem2#1;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_~t#1.base, substring_~t#1.offset; {565#true} is VALID [2022-02-21 04:35:49,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {565#true} call substring_#t~mem3#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);substring_#t~short6#1 := 0 != substring_#t~mem3#1; {567#(or |ULTIMATE.start_substring_#t~short6#1| (= (select (select |#memory_int| |ULTIMATE.start_substring_~pt~0#1.base|) |ULTIMATE.start_substring_~pt~0#1.offset|) 0))} is VALID [2022-02-21 04:35:49,808 INFO L290 TraceCheckUtils]: 3: Hoare triple {567#(or |ULTIMATE.start_substring_#t~short6#1| (= (select (select |#memory_int| |ULTIMATE.start_substring_~pt~0#1.base|) |ULTIMATE.start_substring_~pt~0#1.offset|) 0))} assume !substring_#t~short6#1; {568#(= (select (select |#memory_int| |ULTIMATE.start_substring_~pt~0#1.base|) |ULTIMATE.start_substring_~pt~0#1.offset|) 0)} is VALID [2022-02-21 04:35:49,808 INFO L290 TraceCheckUtils]: 4: Hoare triple {568#(= (select (select |#memory_int| |ULTIMATE.start_substring_~pt~0#1.base|) |ULTIMATE.start_substring_~pt~0#1.offset|) 0)} assume !substring_#t~short6#1;havoc substring_#t~mem3#1;havoc substring_#t~mem4#1;havoc substring_#t~mem5#1;havoc substring_#t~short6#1; {568#(= (select (select |#memory_int| |ULTIMATE.start_substring_~pt~0#1.base|) |ULTIMATE.start_substring_~pt~0#1.offset|) 0)} is VALID [2022-02-21 04:35:49,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {568#(= (select (select |#memory_int| |ULTIMATE.start_substring_~pt~0#1.base|) |ULTIMATE.start_substring_~pt~0#1.offset|) 0)} call substring_#t~mem9#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1); {569#(= |ULTIMATE.start_substring_#t~mem9#1| 0)} is VALID [2022-02-21 04:35:49,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {569#(= |ULTIMATE.start_substring_#t~mem9#1| 0)} assume !(0 == substring_#t~mem9#1);havoc substring_#t~mem9#1;substring_#t~post10#1.base, substring_#t~post10#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_#t~post10#1.base, 1 + substring_#t~post10#1.offset;havoc substring_#t~post10#1.base, substring_#t~post10#1.offset; {566#false} is VALID [2022-02-21 04:35:49,809 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:49,810 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:49,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16813985] [2022-02-21 04:35:49,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16813985] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:49,810 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:49,810 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:35:49,810 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798267182] [2022-02-21 04:35:49,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:49,811 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:35:49,811 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:49,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:35:49,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:35:49,812 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. cyclomatic complexity: 12 Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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:35:49,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:49,893 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-02-21 04:35:49,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:35:49,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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:35:49,910 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:35:49,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2022-02-21 04:35:49,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:35:49,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 26 transitions. [2022-02-21 04:35:49,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 04:35:49,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 04:35:49,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2022-02-21 04:35:49,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:49,914 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-02-21 04:35:49,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2022-02-21 04:35:49,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-21 04:35:49,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:49,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 26 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:49,917 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 26 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:49,917 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:49,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:49,918 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-02-21 04:35:49,919 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-02-21 04:35:49,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:49,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:49,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states and 26 transitions. [2022-02-21 04:35:49,920 INFO L87 Difference]: Start difference. First operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states and 26 transitions. [2022-02-21 04:35:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:49,921 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-02-21 04:35:49,921 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-02-21 04:35:49,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:49,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:49,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:49,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:49,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:49,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-02-21 04:35:49,923 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-02-21 04:35:49,923 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-02-21 04:35:49,923 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:35:49,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2022-02-21 04:35:49,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:35:49,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:49,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:49,925 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:49,925 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:49,926 INFO L791 eck$LassoCheckResult]: Stem: 607#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 608#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1, 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~nondet11#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 614#L532 assume !(main_~length1~0#1 < 1); 612#L532-2 assume !(main_~length2~0#1 < 1); 603#L535-1 call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 604#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 615#L541-4 main_~i~1#1 := 0; 616#L547-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet18#1; 605#L547-2 main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 606#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 619#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_substring } true;substring_#in~s#1.base, substring_#in~s#1.offset, substring_#in~t#1.base, substring_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc substring_#res#1;havoc substring_#t~post7#1.base, substring_#t~post7#1.offset, substring_#t~post8#1.base, substring_#t~post8#1.offset, substring_#t~mem3#1, substring_#t~mem4#1, substring_#t~mem5#1, substring_#t~short6#1, substring_#t~mem9#1, substring_#t~post10#1.base, substring_#t~post10#1.offset, substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset, substring_#t~mem2#1, substring_~s#1.base, substring_~s#1.offset, substring_~t#1.base, substring_~t#1.offset, substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~s#1.base, substring_~s#1.offset := substring_#in~s#1.base, substring_#in~s#1.offset;substring_~t#1.base, substring_~t#1.offset := substring_#in~t#1.base, substring_#in~t#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_~s#1.base, substring_~s#1.offset; 618#L517-3 [2022-02-21 04:35:49,926 INFO L793 eck$LassoCheckResult]: Loop: 618#L517-3 call substring_#t~mem2#1 := read~int(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); 613#L517-1 assume !!(0 != substring_#t~mem2#1);havoc substring_#t~mem2#1;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_~t#1.base, substring_~t#1.offset; 611#L520-5 call substring_#t~mem3#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);substring_#t~short6#1 := 0 != substring_#t~mem3#1; 620#L520-1 assume substring_#t~short6#1;call substring_#t~mem4#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);call substring_#t~mem5#1 := read~int(substring_~ps2~0#1.base, substring_~ps2~0#1.offset, 1);substring_#t~short6#1 := substring_#t~mem4#1 == substring_#t~mem5#1; 609#L520-3 assume !substring_#t~short6#1;havoc substring_#t~mem3#1;havoc substring_#t~mem4#1;havoc substring_#t~mem5#1;havoc substring_#t~short6#1; 610#L520-6 call substring_#t~mem9#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1); 617#L524 assume !(0 == substring_#t~mem9#1);havoc substring_#t~mem9#1;substring_#t~post10#1.base, substring_#t~post10#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_#t~post10#1.base, 1 + substring_#t~post10#1.offset;havoc substring_#t~post10#1.base, substring_#t~post10#1.offset; 618#L517-3 [2022-02-21 04:35:49,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:49,927 INFO L85 PathProgramCache]: Analyzing trace with hash -2087704584, now seen corresponding path program 1 times [2022-02-21 04:35:49,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:49,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212787441] [2022-02-21 04:35:49,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:49,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:49,948 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:49,960 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:49,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:49,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 2 times [2022-02-21 04:35:49,962 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:49,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945728932] [2022-02-21 04:35:49,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:49,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:49,972 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:49,978 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:49,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:49,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1823246168, now seen corresponding path program 1 times [2022-02-21 04:35:49,979 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:49,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13051877] [2022-02-21 04:35:49,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:49,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:50,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {670#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {670#true} is VALID [2022-02-21 04:35:50,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1, 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~nondet11#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {670#true} is VALID [2022-02-21 04:35:50,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {670#true} assume !(main_~length1~0#1 < 1); {672#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:35:50,133 INFO L290 TraceCheckUtils]: 3: Hoare triple {672#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} assume !(main_~length2~0#1 < 1); {672#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:35:50,134 INFO L290 TraceCheckUtils]: 4: Hoare triple {672#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {673#(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:50,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {673#(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); {674#(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:50,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {674#(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; {674#(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:50,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {674#(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~nondet18#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet18#1; {674#(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:50,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {674#(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~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {674#(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:50,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {674#(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); {674#(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:50,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {674#(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_substring } true;substring_#in~s#1.base, substring_#in~s#1.offset, substring_#in~t#1.base, substring_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc substring_#res#1;havoc substring_#t~post7#1.base, substring_#t~post7#1.offset, substring_#t~post8#1.base, substring_#t~post8#1.offset, substring_#t~mem3#1, substring_#t~mem4#1, substring_#t~mem5#1, substring_#t~short6#1, substring_#t~mem9#1, substring_#t~post10#1.base, substring_#t~post10#1.offset, substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset, substring_#t~mem2#1, substring_~s#1.base, substring_~s#1.offset, substring_~t#1.base, substring_~t#1.offset, substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~s#1.base, substring_~s#1.offset := substring_#in~s#1.base, substring_#in~s#1.offset;substring_~t#1.base, substring_~t#1.offset := substring_#in~t#1.base, substring_#in~t#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_~s#1.base, substring_~s#1.offset; {675#(= (select (select |#memory_int| |ULTIMATE.start_substring_~ps~0#1.base|) |ULTIMATE.start_substring_~ps~0#1.offset|) 0)} is VALID [2022-02-21 04:35:50,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {675#(= (select (select |#memory_int| |ULTIMATE.start_substring_~ps~0#1.base|) |ULTIMATE.start_substring_~ps~0#1.offset|) 0)} call substring_#t~mem2#1 := read~int(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); {676#(= |ULTIMATE.start_substring_#t~mem2#1| 0)} is VALID [2022-02-21 04:35:50,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {676#(= |ULTIMATE.start_substring_#t~mem2#1| 0)} assume !!(0 != substring_#t~mem2#1);havoc substring_#t~mem2#1;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_~t#1.base, substring_~t#1.offset; {671#false} is VALID [2022-02-21 04:35:50,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {671#false} call substring_#t~mem3#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);substring_#t~short6#1 := 0 != substring_#t~mem3#1; {671#false} is VALID [2022-02-21 04:35:50,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {671#false} assume substring_#t~short6#1;call substring_#t~mem4#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);call substring_#t~mem5#1 := read~int(substring_~ps2~0#1.base, substring_~ps2~0#1.offset, 1);substring_#t~short6#1 := substring_#t~mem4#1 == substring_#t~mem5#1; {671#false} is VALID [2022-02-21 04:35:50,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {671#false} assume !substring_#t~short6#1;havoc substring_#t~mem3#1;havoc substring_#t~mem4#1;havoc substring_#t~mem5#1;havoc substring_#t~short6#1; {671#false} is VALID [2022-02-21 04:35:50,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {671#false} call substring_#t~mem9#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1); {671#false} is VALID [2022-02-21 04:35:50,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {671#false} assume !(0 == substring_#t~mem9#1);havoc substring_#t~mem9#1;substring_#t~post10#1.base, substring_#t~post10#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_#t~post10#1.base, 1 + substring_#t~post10#1.offset;havoc substring_#t~post10#1.base, substring_#t~post10#1.offset; {671#false} is VALID [2022-02-21 04:35:50,144 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:50,144 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:50,144 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13051877] [2022-02-21 04:35:50,144 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13051877] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:50,145 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:50,145 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 04:35:50,145 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147634442] [2022-02-21 04:35:50,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:50,332 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:50,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 04:35:50,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-21 04:35:50,333 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:50,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:50,474 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-02-21 04:35:50,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 04:35:50,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:50,491 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:50,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 34 transitions. [2022-02-21 04:35:50,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:35:50,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 26 transitions. [2022-02-21 04:35:50,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 04:35:50,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 04:35:50,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2022-02-21 04:35:50,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:50,494 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-02-21 04:35:50,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2022-02-21 04:35:50,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-02-21 04:35:50,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:50,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 26 transitions. Second operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 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:50,495 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 26 transitions. Second operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 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:50,495 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 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:50,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:50,496 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-02-21 04:35:50,496 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-02-21 04:35:50,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:50,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:50,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states and 26 transitions. [2022-02-21 04:35:50,496 INFO L87 Difference]: Start difference. First operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states and 26 transitions. [2022-02-21 04:35:50,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:50,497 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-02-21 04:35:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-02-21 04:35:50,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:50,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:50,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:50,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 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:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-02-21 04:35:50,498 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-02-21 04:35:50,498 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-02-21 04:35:50,498 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:35:50,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2022-02-21 04:35:50,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:35:50,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:50,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:50,498 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:50,498 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:50,499 INFO L791 eck$LassoCheckResult]: Stem: 711#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 712#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1, 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~nondet11#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 719#L532 assume !(main_~length1~0#1 < 1); 718#L532-2 assume !(main_~length2~0#1 < 1); 709#L535-1 call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 710#L541-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet16#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; 727#L541-2 main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 728#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 721#L541-4 main_~i~1#1 := 0; 722#L547-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet18#1; 713#L547-2 main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 714#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 725#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_substring } true;substring_#in~s#1.base, substring_#in~s#1.offset, substring_#in~t#1.base, substring_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc substring_#res#1;havoc substring_#t~post7#1.base, substring_#t~post7#1.offset, substring_#t~post8#1.base, substring_#t~post8#1.offset, substring_#t~mem3#1, substring_#t~mem4#1, substring_#t~mem5#1, substring_#t~short6#1, substring_#t~mem9#1, substring_#t~post10#1.base, substring_#t~post10#1.offset, substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset, substring_#t~mem2#1, substring_~s#1.base, substring_~s#1.offset, substring_~t#1.base, substring_~t#1.offset, substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~s#1.base, substring_~s#1.offset := substring_#in~s#1.base, substring_#in~s#1.offset;substring_~t#1.base, substring_~t#1.offset := substring_#in~t#1.base, substring_#in~t#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_~s#1.base, substring_~s#1.offset; 724#L517-3 [2022-02-21 04:35:50,499 INFO L793 eck$LassoCheckResult]: Loop: 724#L517-3 call substring_#t~mem2#1 := read~int(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); 720#L517-1 assume !!(0 != substring_#t~mem2#1);havoc substring_#t~mem2#1;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_~t#1.base, substring_~t#1.offset; 717#L520-5 call substring_#t~mem3#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);substring_#t~short6#1 := 0 != substring_#t~mem3#1; 726#L520-1 assume substring_#t~short6#1;call substring_#t~mem4#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);call substring_#t~mem5#1 := read~int(substring_~ps2~0#1.base, substring_~ps2~0#1.offset, 1);substring_#t~short6#1 := substring_#t~mem4#1 == substring_#t~mem5#1; 715#L520-3 assume !substring_#t~short6#1;havoc substring_#t~mem3#1;havoc substring_#t~mem4#1;havoc substring_#t~mem5#1;havoc substring_#t~short6#1; 716#L520-6 call substring_#t~mem9#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1); 723#L524 assume !(0 == substring_#t~mem9#1);havoc substring_#t~mem9#1;substring_#t~post10#1.base, substring_#t~post10#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_#t~post10#1.base, 1 + substring_#t~post10#1.offset;havoc substring_#t~post10#1.base, substring_#t~post10#1.offset; 724#L517-3 [2022-02-21 04:35:50,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:50,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2022-02-21 04:35:50,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:50,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618996541] [2022-02-21 04:35:50,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:50,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:50,521 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:50,531 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:50,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:50,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 3 times [2022-02-21 04:35:50,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:50,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847331579] [2022-02-21 04:35:50,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:50,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:50,540 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:50,544 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:50,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:50,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1498710394, now seen corresponding path program 1 times [2022-02-21 04:35:50,545 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:50,545 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243314510] [2022-02-21 04:35:50,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:50,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:50,567 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:50,581 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:51,555 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:51,555 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:51,555 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:51,555 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:51,555 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:51,555 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:51,556 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:51,556 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:51,556 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration6_Lasso [2022-02-21 04:35:51,556 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:51,556 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:51,560 INFO L141 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:51,565 INFO L141 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:51,567 INFO L141 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:51,570 INFO L141 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:51,572 INFO L141 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:51,574 INFO L141 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:51,576 INFO L141 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:51,578 INFO L141 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:51,580 INFO L141 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:51,582 INFO L141 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:51,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:51,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:51,589 INFO L141 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:51,592 INFO L141 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:51,594 INFO L141 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:51,596 INFO L141 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:51,598 INFO L141 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:51,600 INFO L141 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:52,338 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 04:35:52,341 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 04:35:52,348 INFO L141 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:52,351 INFO L141 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:52,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:52,355 INFO L141 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:52,357 INFO L141 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:52,360 INFO L141 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:52,363 INFO L141 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:52,369 INFO L141 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:52,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:53,122 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:53,123 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:53,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:53,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:53,128 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:53,131 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:53,133 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:53,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:53,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:53,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:53,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:53,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:53,141 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:53,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:53,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:53,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:53,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:53,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:53,191 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:53,192 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:53,193 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:53,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:53,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:53,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:53,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:53,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:53,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:53,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:53,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:53,239 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:53,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:53,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:53,240 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:53,241 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:53,243 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:53,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:53,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:53,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:53,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:53,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:53,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:53,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:53,259 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:53,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:53,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:53,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:53,277 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:53,277 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:53,279 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:53,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:53,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:53,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:53,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:53,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:53,285 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:53,285 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:53,286 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:53,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 04:35:53,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:53,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:53,303 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:53,306 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:53,306 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:53,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:53,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:53,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:53,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:53,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:53,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:53,315 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:53,331 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:53,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:53,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:53,332 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:53,333 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:53,334 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:53,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:53,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:53,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:53,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:53,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:53,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:53,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:53,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:53,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:53,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:53,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:53,359 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:53,360 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:53,361 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:53,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:53,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:53,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:53,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:53,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:53,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:53,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:53,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:53,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:53,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:53,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:53,398 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:53,398 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:53,399 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:53,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:53,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:53,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:53,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:53,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:53,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:53,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:53,406 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:53,422 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:53,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:53,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:53,423 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:53,424 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:53,425 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:53,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:53,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:53,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:53,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:53,434 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:53,434 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:53,437 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:53,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-02-21 04:35:53,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:53,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:53,454 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:53,454 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:53,456 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:53,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:53,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:53,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:53,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:53,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:53,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:53,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:53,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:53,478 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:53,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:53,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:53,479 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:53,480 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:53,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:53,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:53,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:53,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:53,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:53,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:53,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:53,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:53,489 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:53,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-02-21 04:35:53,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:53,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:53,506 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:53,507 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:53,508 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:53,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:53,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:53,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:53,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:53,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:53,514 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:53,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:53,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:53,531 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:53,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:53,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:53,532 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:53,533 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:53,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:53,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:53,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:53,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:53,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:53,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:53,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:53,549 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:53,565 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:53,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:53,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:53,567 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:53,568 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:53,570 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:53,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:53,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:53,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:53,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:53,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:53,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:53,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:53,582 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:53,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:53,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:53,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:53,599 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:53,600 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:53,602 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:53,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:53,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:53,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:53,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:53,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:53,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:53,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:53,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:53,624 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:53,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:53,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:53,626 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:53,626 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:53,628 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:53,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:53,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:53,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:53,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:53,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:53,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:53,637 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:53,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:53,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:53,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:53,657 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:53,658 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:53,660 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:53,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:53,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:53,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:53,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:53,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:53,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:53,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:53,667 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:53,683 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:53,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:53,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:53,684 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:53,685 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:53,686 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:53,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:53,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:53,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:53,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:53,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:53,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:53,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:53,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:53,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:53,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:53,715 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:53,716 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:53,717 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:53,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:53,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:53,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:53,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:53,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:53,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:53,775 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:53,817 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-02-21 04:35:53,817 INFO L444 ModelExtractionUtils]: 38 out of 61 variables were initially zero. Simplification set additionally 20 variables to zero. [2022-02-21 04:35:53,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:53,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:53,819 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:53,825 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:53,826 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:53,832 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:53,832 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:53,832 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_2, ULTIMATE.start_substring_~ps~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_2 - 1*ULTIMATE.start_substring_~ps~0#1.offset Supporting invariants [] [2022-02-21 04:35:53,849 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:53,937 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2022-02-21 04:35:53,943 INFO L390 LassoCheck]: Loop: "call substring_#t~mem2#1 := read~int(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1);" "assume !!(0 != substring_#t~mem2#1);havoc substring_#t~mem2#1;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_~t#1.base, substring_~t#1.offset;" "call substring_#t~mem3#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);substring_#t~short6#1 := 0 != substring_#t~mem3#1;" "assume substring_#t~short6#1;call substring_#t~mem4#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);call substring_#t~mem5#1 := read~int(substring_~ps2~0#1.base, substring_~ps2~0#1.offset, 1);substring_#t~short6#1 := substring_#t~mem4#1 == substring_#t~mem5#1;" "assume !substring_#t~short6#1;havoc substring_#t~mem3#1;havoc substring_#t~mem4#1;havoc substring_#t~mem5#1;havoc substring_#t~short6#1;" "call substring_#t~mem9#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);" "assume !(0 == substring_#t~mem9#1);havoc substring_#t~mem9#1;substring_#t~post10#1.base, substring_#t~post10#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_#t~post10#1.base, 1 + substring_#t~post10#1.offset;havoc substring_#t~post10#1.base, substring_#t~post10#1.offset;" [2022-02-21 04:35:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:53,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:53,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:35:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:54,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:54,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {780#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {780#unseeded} is VALID [2022-02-21 04:35:54,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {780#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1, 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~nondet11#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {780#unseeded} is VALID [2022-02-21 04:35:54,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {780#unseeded} assume !(main_~length1~0#1 < 1); {780#unseeded} is VALID [2022-02-21 04:35:54,037 INFO L290 TraceCheckUtils]: 3: Hoare triple {780#unseeded} assume !(main_~length2~0#1 < 1); {780#unseeded} is VALID [2022-02-21 04:35:54,037 INFO L290 TraceCheckUtils]: 4: Hoare triple {780#unseeded} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {780#unseeded} is VALID [2022-02-21 04:35:54,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {780#unseeded} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet16#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; {780#unseeded} is VALID [2022-02-21 04:35:54,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {780#unseeded} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {780#unseeded} is VALID [2022-02-21 04:35:54,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {780#unseeded} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {780#unseeded} is VALID [2022-02-21 04:35:54,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {780#unseeded} main_~i~1#1 := 0; {780#unseeded} is VALID [2022-02-21 04:35:54,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {780#unseeded} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet18#1; {780#unseeded} is VALID [2022-02-21 04:35:54,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {780#unseeded} main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {780#unseeded} is VALID [2022-02-21 04:35:54,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {780#unseeded} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {780#unseeded} is VALID [2022-02-21 04:35:54,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {780#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_substring } true;substring_#in~s#1.base, substring_#in~s#1.offset, substring_#in~t#1.base, substring_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc substring_#res#1;havoc substring_#t~post7#1.base, substring_#t~post7#1.offset, substring_#t~post8#1.base, substring_#t~post8#1.offset, substring_#t~mem3#1, substring_#t~mem4#1, substring_#t~mem5#1, substring_#t~short6#1, substring_#t~mem9#1, substring_#t~post10#1.base, substring_#t~post10#1.offset, substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset, substring_#t~mem2#1, substring_~s#1.base, substring_~s#1.offset, substring_~t#1.base, substring_~t#1.offset, substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~s#1.base, substring_~s#1.offset := substring_#in~s#1.base, substring_#in~s#1.offset;substring_~t#1.base, substring_~t#1.offset := substring_#in~t#1.base, substring_#in~t#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_~s#1.base, substring_~s#1.offset; {874#(and (= |ULTIMATE.start_substring_~ps~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} is VALID [2022-02-21 04:35:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:54,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:35:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:54,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:54,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:54,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {875#(and (= |ULTIMATE.start_substring_~ps~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|) (* (- 1) |ULTIMATE.start_substring_~ps~0#1.offset|))))} call substring_#t~mem2#1 := read~int(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); {919#(and (= |ULTIMATE.start_substring_~ps~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_substring_~ps~0#1.offset| 1) (select |#length| |ULTIMATE.start_substring_~ps~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|) (* (- 1) |ULTIMATE.start_substring_~ps~0#1.offset|))))} is VALID [2022-02-21 04:35:54,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {919#(and (= |ULTIMATE.start_substring_~ps~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_substring_~ps~0#1.offset| 1) (select |#length| |ULTIMATE.start_substring_~ps~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|) (* (- 1) |ULTIMATE.start_substring_~ps~0#1.offset|))))} assume !!(0 != substring_#t~mem2#1);havoc substring_#t~mem2#1;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_~t#1.base, substring_~t#1.offset; {919#(and (= |ULTIMATE.start_substring_~ps~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_substring_~ps~0#1.offset| 1) (select |#length| |ULTIMATE.start_substring_~ps~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|) (* (- 1) |ULTIMATE.start_substring_~ps~0#1.offset|))))} is VALID [2022-02-21 04:35:54,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {919#(and (= |ULTIMATE.start_substring_~ps~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_substring_~ps~0#1.offset| 1) (select |#length| |ULTIMATE.start_substring_~ps~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|) (* (- 1) |ULTIMATE.start_substring_~ps~0#1.offset|))))} call substring_#t~mem3#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);substring_#t~short6#1 := 0 != substring_#t~mem3#1; {919#(and (= |ULTIMATE.start_substring_~ps~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_substring_~ps~0#1.offset| 1) (select |#length| |ULTIMATE.start_substring_~ps~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|) (* (- 1) |ULTIMATE.start_substring_~ps~0#1.offset|))))} is VALID [2022-02-21 04:35:54,219 INFO L290 TraceCheckUtils]: 3: Hoare triple {919#(and (= |ULTIMATE.start_substring_~ps~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_substring_~ps~0#1.offset| 1) (select |#length| |ULTIMATE.start_substring_~ps~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|) (* (- 1) |ULTIMATE.start_substring_~ps~0#1.offset|))))} assume substring_#t~short6#1;call substring_#t~mem4#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);call substring_#t~mem5#1 := read~int(substring_~ps2~0#1.base, substring_~ps2~0#1.offset, 1);substring_#t~short6#1 := substring_#t~mem4#1 == substring_#t~mem5#1; {919#(and (= |ULTIMATE.start_substring_~ps~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_substring_~ps~0#1.offset| 1) (select |#length| |ULTIMATE.start_substring_~ps~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|) (* (- 1) |ULTIMATE.start_substring_~ps~0#1.offset|))))} is VALID [2022-02-21 04:35:54,220 INFO L290 TraceCheckUtils]: 4: Hoare triple {919#(and (= |ULTIMATE.start_substring_~ps~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_substring_~ps~0#1.offset| 1) (select |#length| |ULTIMATE.start_substring_~ps~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|) (* (- 1) |ULTIMATE.start_substring_~ps~0#1.offset|))))} assume !substring_#t~short6#1;havoc substring_#t~mem3#1;havoc substring_#t~mem4#1;havoc substring_#t~mem5#1;havoc substring_#t~short6#1; {919#(and (= |ULTIMATE.start_substring_~ps~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_substring_~ps~0#1.offset| 1) (select |#length| |ULTIMATE.start_substring_~ps~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|) (* (- 1) |ULTIMATE.start_substring_~ps~0#1.offset|))))} is VALID [2022-02-21 04:35:54,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {919#(and (= |ULTIMATE.start_substring_~ps~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_substring_~ps~0#1.offset| 1) (select |#length| |ULTIMATE.start_substring_~ps~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|) (* (- 1) |ULTIMATE.start_substring_~ps~0#1.offset|))))} call substring_#t~mem9#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1); {919#(and (= |ULTIMATE.start_substring_~ps~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_substring_~ps~0#1.offset| 1) (select |#length| |ULTIMATE.start_substring_~ps~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|) (* (- 1) |ULTIMATE.start_substring_~ps~0#1.offset|))))} is VALID [2022-02-21 04:35:54,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {919#(and (= |ULTIMATE.start_substring_~ps~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_substring_~ps~0#1.offset| 1) (select |#length| |ULTIMATE.start_substring_~ps~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|) (* (- 1) |ULTIMATE.start_substring_~ps~0#1.offset|))))} assume !(0 == substring_#t~mem9#1);havoc substring_#t~mem9#1;substring_#t~post10#1.base, substring_#t~post10#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_#t~post10#1.base, 1 + substring_#t~post10#1.offset;havoc substring_#t~post10#1.base, substring_#t~post10#1.offset; {877#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|) (* (- 1) |ULTIMATE.start_substring_~ps~0#1.offset|))))) (= |ULTIMATE.start_substring_~ps~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} is VALID [2022-02-21 04:35:54,222 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:54,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:54,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:54,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 7 letters. [2022-02-21 04:35:54,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,236 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:35:54,236 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:54,295 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 34 transitions. Complement of second has 4 states. [2022-02-21 04:35:54,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:54,295 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:54,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. cyclomatic complexity: 8 [2022-02-21 04:35:54,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:54,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:54,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:54,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:54,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:54,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:54,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2022-02-21 04:35:54,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:54,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:54,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:54,298 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 25 transitions. cyclomatic complexity: 8 [2022-02-21 04:35:54,300 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 04:35:54,300 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:54,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:54,301 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:54,301 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 34 transitions. cyclomatic complexity: 11 [2022-02-21 04:35:54,301 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:35:54,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 7 letters. [2022-02-21 04:35:54,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 7 letters. [2022-02-21 04:35:54,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 7 letters. [2022-02-21 04:35:54,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:54,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:54,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:54,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:54,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:54,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:54,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 27 letters. [2022-02-21 04:35:54,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 27 letters. [2022-02-21 04:35:54,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 27 letters. Loop has 27 letters. [2022-02-21 04:35:54,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 20 letters. [2022-02-21 04:35:54,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 20 letters. [2022-02-21 04:35:54,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 20 letters. [2022-02-21 04:35:54,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:35:54,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:35:54,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:35:54,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 7 letters. [2022-02-21 04:35:54,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 7 letters. [2022-02-21 04:35:54,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 7 letters. [2022-02-21 04:35:54,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 7 letters. [2022-02-21 04:35:54,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 7 letters. [2022-02-21 04:35:54,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 19 letters. Loop has 7 letters. [2022-02-21 04:35:54,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 7 letters. [2022-02-21 04:35:54,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 7 letters. [2022-02-21 04:35:54,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 7 letters. [2022-02-21 04:35:54,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:54,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:54,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:54,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:54,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:54,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:54,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 7 letters. [2022-02-21 04:35:54,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 7 letters. [2022-02-21 04:35:54,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 18 letters. Loop has 7 letters. [2022-02-21 04:35:54,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:54,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:54,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:54,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:54,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:54,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:54,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:54,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:54,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:54,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:54,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:54,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:54,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:54,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:54,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:54,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,316 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:54,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-21 04:35:54,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 7 letters. [2022-02-21 04:35:54,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 20 letters. Loop has 7 letters. [2022-02-21 04:35:54,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 14 letters. [2022-02-21 04:35:54,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:54,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. cyclomatic complexity: 11 [2022-02-21 04:35:54,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:54,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 32 transitions. [2022-02-21 04:35:54,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 04:35:54,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 04:35:54,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2022-02-21 04:35:54,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:35:54,322 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-21 04:35:54,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2022-02-21 04:35:54,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-21 04:35:54,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:54,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 32 transitions. Second operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:54,326 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 32 transitions. Second operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:54,326 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:54,327 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:54,330 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-21 04:35:54,330 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-21 04:35:54,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:54,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:54,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states and 32 transitions. [2022-02-21 04:35:54,331 INFO L87 Difference]: Start difference. First operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states and 32 transitions. [2022-02-21 04:35:54,332 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:54,333 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-21 04:35:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-21 04:35:54,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:54,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:54,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:54,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-02-21 04:35:54,337 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-21 04:35:54,337 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-21 04:35:54,337 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 04:35:54,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2022-02-21 04:35:54,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:54,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:54,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:54,338 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:54,338 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:54,338 INFO L791 eck$LassoCheckResult]: Stem: 974#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 975#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1, 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~nondet11#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 986#L532 assume !(main_~length1~0#1 < 1); 983#L532-2 assume !(main_~length2~0#1 < 1); 972#L535-1 call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 973#L541-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet16#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; 995#L541-2 main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 996#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 987#L541-4 main_~i~1#1 := 0; 988#L547-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet18#1; 976#L547-2 main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 977#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 991#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_substring } true;substring_#in~s#1.base, substring_#in~s#1.offset, substring_#in~t#1.base, substring_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc substring_#res#1;havoc substring_#t~post7#1.base, substring_#t~post7#1.offset, substring_#t~post8#1.base, substring_#t~post8#1.offset, substring_#t~mem3#1, substring_#t~mem4#1, substring_#t~mem5#1, substring_#t~short6#1, substring_#t~mem9#1, substring_#t~post10#1.base, substring_#t~post10#1.offset, substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset, substring_#t~mem2#1, substring_~s#1.base, substring_~s#1.offset, substring_~t#1.base, substring_~t#1.offset, substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~s#1.base, substring_~s#1.offset := substring_#in~s#1.base, substring_#in~s#1.offset;substring_~t#1.base, substring_~t#1.offset := substring_#in~t#1.base, substring_#in~t#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_~s#1.base, substring_~s#1.offset; 992#L517-3 call substring_#t~mem2#1 := read~int(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); 984#L517-1 assume !!(0 != substring_#t~mem2#1);havoc substring_#t~mem2#1;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_~t#1.base, substring_~t#1.offset; 979#L520-5 [2022-02-21 04:35:54,339 INFO L793 eck$LassoCheckResult]: Loop: 979#L520-5 call substring_#t~mem3#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);substring_#t~short6#1 := 0 != substring_#t~mem3#1; 993#L520-1 assume substring_#t~short6#1;call substring_#t~mem4#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);call substring_#t~mem5#1 := read~int(substring_~ps2~0#1.base, substring_~ps2~0#1.offset, 1);substring_#t~short6#1 := substring_#t~mem4#1 == substring_#t~mem5#1; 978#L520-3 assume !!substring_#t~short6#1;havoc substring_#t~mem3#1;havoc substring_#t~mem4#1;havoc substring_#t~mem5#1;havoc substring_#t~short6#1;substring_#t~post7#1.base, substring_#t~post7#1.offset := substring_~pt~0#1.base, substring_~pt~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_#t~post7#1.base, 1 + substring_#t~post7#1.offset;havoc substring_#t~post7#1.base, substring_#t~post7#1.offset;substring_#t~post8#1.base, substring_#t~post8#1.offset := substring_~ps2~0#1.base, substring_~ps2~0#1.offset;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_#t~post8#1.base, 1 + substring_#t~post8#1.offset;havoc substring_#t~post8#1.base, substring_#t~post8#1.offset; 979#L520-5 [2022-02-21 04:35:54,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:54,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2055034719, now seen corresponding path program 1 times [2022-02-21 04:35:54,340 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:54,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812193886] [2022-02-21 04:35:54,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:54,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:54,369 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:54,384 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:54,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:54,384 INFO L85 PathProgramCache]: Analyzing trace with hash 87489, now seen corresponding path program 1 times [2022-02-21 04:35:54,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:54,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784611028] [2022-02-21 04:35:54,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:54,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:54,395 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:54,399 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:54,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:54,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1075534243, now seen corresponding path program 1 times [2022-02-21 04:35:54,400 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:54,400 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927752112] [2022-02-21 04:35:54,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:54,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:54,426 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:54,449 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:55,654 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:55,654 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:55,654 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:55,654 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:55,654 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:55,654 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:55,654 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:55,654 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:55,654 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration7_Lasso [2022-02-21 04:35:55,654 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:55,654 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:55,658 INFO L141 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:55,660 INFO L141 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:55,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:55,666 INFO L141 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:55,668 INFO L141 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:55,670 INFO L141 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:55,672 INFO L141 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:55,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:55,681 INFO L141 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:55,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:55,685 INFO L141 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:55,687 INFO L141 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:55,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:55,691 INFO L141 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:55,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:55,695 INFO L141 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:55,705 INFO L141 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:55,707 INFO L141 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:55,709 INFO L141 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:55,711 INFO L141 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:55,713 INFO L141 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:55,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:55,720 INFO L141 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:55,722 INFO L141 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:55,725 INFO L141 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:56,534 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~nondetString1~0#1.base) (+ ULTIMATE.start_main_~i~0#1 ULTIMATE.start_main_~nondetString1~0#1.offset (- 1)))_1 was not added to the transformula! at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:509) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 04:35:56,539 INFO L158 Benchmark]: Toolchain (without parser) took 13107.50ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 53.8MB in the beginning and 47.3MB in the end (delta: 6.5MB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. [2022-02-21 04:35:56,540 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 98.6MB. Free memory is still 71.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:56,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.39ms. Allocated memory is still 98.6MB. Free memory was 53.7MB in the beginning and 71.1MB in the end (delta: -17.4MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2022-02-21 04:35:56,540 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.55ms. Allocated memory is still 98.6MB. Free memory was 71.1MB in the beginning and 68.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:56,541 INFO L158 Benchmark]: Boogie Preprocessor took 31.86ms. Allocated memory is still 98.6MB. Free memory was 68.9MB in the beginning and 67.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:56,541 INFO L158 Benchmark]: RCFGBuilder took 372.78ms. Allocated memory is still 98.6MB. Free memory was 67.2MB in the beginning and 52.2MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 04:35:56,541 INFO L158 Benchmark]: BuchiAutomizer took 12242.51ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 52.2MB in the beginning and 47.3MB in the end (delta: 4.9MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. [2022-02-21 04:35:56,543 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.26ms. Allocated memory is still 98.6MB. Free memory is still 71.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.39ms. Allocated memory is still 98.6MB. Free memory was 53.7MB in the beginning and 71.1MB in the end (delta: -17.4MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.55ms. Allocated memory is still 98.6MB. Free memory was 71.1MB in the beginning and 68.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.86ms. Allocated memory is still 98.6MB. Free memory was 68.9MB in the beginning and 67.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 372.78ms. Allocated memory is still 98.6MB. Free memory was 67.2MB in the beginning and 52.2MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 12242.51ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 52.2MB in the beginning and 47.3MB in the end (delta: 4.9MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~nondetString1~0#1.base) (+ ULTIMATE.start_main_~i~0#1 ULTIMATE.start_main_~nondetString1~0#1.offset (- 1)))_1 was not added to the transformula! de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~nondetString1~0#1.base) (+ ULTIMATE.start_main_~i~0#1 ULTIMATE.start_main_~nondetString1~0#1.offset (- 1)))_1 was not added to the transformula!: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 04:35:56,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~nondetString1~0#1.base) (+ ULTIMATE.start_main_~i~0#1 ULTIMATE.start_main_~nondetString1~0#1.offset (- 1)))_1 was not added to the transformula!