./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/substring-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-?-3598765 [2022-07-22 03:14:09,017 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 03:14:09,020 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 03:14:09,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 03:14:09,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 03:14:09,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 03:14:09,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 03:14:09,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 03:14:09,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 03:14:09,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 03:14:09,070 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 03:14:09,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 03:14:09,072 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 03:14:09,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 03:14:09,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 03:14:09,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 03:14:09,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 03:14:09,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 03:14:09,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 03:14:09,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 03:14:09,086 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 03:14:09,087 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 03:14:09,088 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 03:14:09,089 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 03:14:09,090 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 03:14:09,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 03:14:09,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 03:14:09,094 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 03:14:09,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 03:14:09,095 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 03:14:09,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 03:14:09,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 03:14:09,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 03:14:09,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 03:14:09,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 03:14:09,099 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 03:14:09,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 03:14:09,100 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 03:14:09,100 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 03:14:09,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 03:14:09,101 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 03:14:09,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 03:14:09,107 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-22 03:14:09,128 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 03:14:09,129 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 03:14:09,129 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 03:14:09,129 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 03:14:09,130 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 03:14:09,130 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 03:14:09,130 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 03:14:09,131 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 03:14:09,131 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 03:14:09,131 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 03:14:09,131 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 03:14:09,132 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 03:14:09,132 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 03:14:09,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 03:14:09,132 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 03:14:09,132 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 03:14:09,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 03:14:09,132 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 03:14:09,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 03:14:09,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 03:14:09,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 03:14:09,133 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 03:14:09,133 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 03:14:09,133 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 03:14:09,133 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 03:14:09,134 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 03:14:09,134 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 03:14:09,134 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 03:14:09,134 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 03:14:09,134 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 03:14:09,134 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 03:14:09,136 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 03:14:09,136 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-07-22 03:14:09,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 03:14:09,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 03:14:09,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 03:14:09,430 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 03:14:09,430 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 03:14:09,432 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-07-22 03:14:09,477 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbe76016d/cb1ffb0921f2413188b006bc0c5a9ad0/FLAG1a0723f89 [2022-07-22 03:14:09,886 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 03:14:09,887 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2022-07-22 03:14:09,895 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbe76016d/cb1ffb0921f2413188b006bc0c5a9ad0/FLAG1a0723f89 [2022-07-22 03:14:10,244 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbe76016d/cb1ffb0921f2413188b006bc0c5a9ad0 [2022-07-22 03:14:10,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 03:14:10,248 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 03:14:10,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 03:14:10,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 03:14:10,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 03:14:10,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:14:10" (1/1) ... [2022-07-22 03:14:10,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd6d158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:10, skipping insertion in model container [2022-07-22 03:14:10,254 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:14:10" (1/1) ... [2022-07-22 03:14:10,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 03:14:10,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 03:14:10,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 03:14:10,537 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 03:14:10,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 03:14:10,611 INFO L208 MainTranslator]: Completed translation [2022-07-22 03:14:10,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:10 WrapperNode [2022-07-22 03:14:10,613 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 03:14:10,614 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 03:14:10,614 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 03:14:10,614 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 03:14:10,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:10" (1/1) ... [2022-07-22 03:14:10,638 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:10" (1/1) ... [2022-07-22 03:14:10,659 INFO L137 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2022-07-22 03:14:10,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 03:14:10,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 03:14:10,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 03:14:10,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 03:14:10,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:10" (1/1) ... [2022-07-22 03:14:10,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:10" (1/1) ... [2022-07-22 03:14:10,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:10" (1/1) ... [2022-07-22 03:14:10,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:10" (1/1) ... [2022-07-22 03:14:10,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:10" (1/1) ... [2022-07-22 03:14:10,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:10" (1/1) ... [2022-07-22 03:14:10,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:10" (1/1) ... [2022-07-22 03:14:10,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 03:14:10,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 03:14:10,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 03:14:10,702 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 03:14:10,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:10" (1/1) ... [2022-07-22 03:14:10,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:10,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:10,734 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-07-22 03:14:10,743 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-07-22 03:14:10,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 03:14:10,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 03:14:10,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 03:14:10,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 03:14:10,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 03:14:10,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 03:14:10,881 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 03:14:10,883 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 03:14:11,048 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 03:14:11,052 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 03:14:11,053 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 03:14:11,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:14:11 BoogieIcfgContainer [2022-07-22 03:14:11,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 03:14:11,055 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 03:14:11,055 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 03:14:11,057 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 03:14:11,057 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 03:14:11,057 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 03:14:10" (1/3) ... [2022-07-22 03:14:11,058 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@618e3881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 03:14:11, skipping insertion in model container [2022-07-22 03:14:11,058 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 03:14:11,058 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:10" (2/3) ... [2022-07-22 03:14:11,059 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@618e3881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 03:14:11, skipping insertion in model container [2022-07-22 03:14:11,059 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 03:14:11,059 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:14:11" (3/3) ... [2022-07-22 03:14:11,060 INFO L354 chiAutomizerObserver]: Analyzing ICFG substring-alloca-2.i [2022-07-22 03:14:11,092 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 03:14:11,093 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 03:14:11,093 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 03:14:11,093 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 03:14:11,093 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 03:14:11,093 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 03:14:11,093 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 03:14:11,094 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 03:14:11,096 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-07-22 03:14:11,109 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-07-22 03:14:11,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:14:11,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:14:11,113 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 03:14:11,113 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 03:14:11,113 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 03:14:11,113 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-07-22 03:14:11,115 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-07-22 03:14:11,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:14:11,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:14:11,116 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 03:14:11,116 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 03:14:11,120 INFO L752 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~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; 10#L532true assume !(main_~length1~0#1 < 1); 7#L532-2true assume !(main_~length2~0#1 < 1); 2#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; 17#L541-3true [2022-07-22 03:14:11,120 INFO L754 eck$LassoCheckResult]: Loop: 17#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; 22#L541-2true main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 17#L541-3true [2022-07-22 03:14:11,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:11,125 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-07-22 03:14:11,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:11,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849267404] [2022-07-22 03:14:11,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:11,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:11,218 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:11,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:11,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:11,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-07-22 03:14:11,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:11,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305272834] [2022-07-22 03:14:11,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:11,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:11,282 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:11,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:11,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:11,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-07-22 03:14:11,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:11,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638638735] [2022-07-22 03:14:11,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:11,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:11,335 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:11,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:11,688 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 03:14:11,688 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 03:14:11,689 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 03:14:11,689 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 03:14:11,689 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 03:14:11,689 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:11,689 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 03:14:11,689 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 03:14:11,690 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration1_Lasso [2022-07-22 03:14:11,690 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 03:14:11,690 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 03:14:11,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-07-22 03:14:11,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-07-22 03:14:11,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-07-22 03:14:11,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:11,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:11,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-07-22 03:14:11,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:11,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:11,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:11,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:11,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:11,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:11,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:11,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:11,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:12,074 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 03:14:12,077 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 03:14:12,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:12,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:12,097 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-07-22 03:14:12,101 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-07-22 03:14:12,104 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-07-22 03:14:12,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:12,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:12,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:12,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:12,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:12,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:12,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:12,123 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:12,139 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-07-22 03:14:12,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:12,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:12,141 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-07-22 03:14:12,142 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-07-22 03:14:12,143 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-07-22 03:14:12,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:12,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:12,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:12,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:12,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:12,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:12,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:12,171 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:12,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:12,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:12,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:12,194 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-07-22 03:14:12,195 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-07-22 03:14:12,195 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-07-22 03:14:12,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:12,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:12,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:12,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:12,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:12,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:12,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:12,213 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:12,229 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-07-22 03:14:12,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:12,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:12,231 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-07-22 03:14:12,231 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-07-22 03:14:12,233 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-07-22 03:14:12,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:12,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:12,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:12,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:12,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:12,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:12,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:12,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:12,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-22 03:14:12,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:12,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:12,271 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-07-22 03:14:12,273 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-07-22 03:14:12,276 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-07-22 03:14:12,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:12,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:12,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:12,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:12,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:12,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:12,299 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:12,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:12,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:12,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:12,317 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-07-22 03:14:12,317 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-07-22 03:14:12,323 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-07-22 03:14:12,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:12,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:12,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:12,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:12,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:12,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:12,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:12,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-22 03:14:12,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:12,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:12,370 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-07-22 03:14:12,371 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-07-22 03:14:12,372 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-07-22 03:14:12,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:12,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:12,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:12,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:12,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:12,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:12,409 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:12,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:12,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:12,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:12,429 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-07-22 03:14:12,429 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-07-22 03:14:12,431 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-07-22 03:14:12,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:12,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:12,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:12,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:12,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:12,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:12,462 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:12,478 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-07-22 03:14:12,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:12,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:12,480 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-07-22 03:14:12,481 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-07-22 03:14:12,483 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-07-22 03:14:12,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:12,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:12,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:12,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:12,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:12,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:12,494 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:12,509 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-07-22 03:14:12,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:12,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:12,511 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-07-22 03:14:12,511 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-07-22 03:14:12,513 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-07-22 03:14:12,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:12,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:12,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:12,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:12,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:12,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:12,531 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 03:14:12,590 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2022-07-22 03:14:12,591 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-22 03:14:12,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:12,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:12,619 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-07-22 03:14:12,650 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 03:14:12,659 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-07-22 03:14:12,663 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-22 03:14:12,663 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 03:14:12,664 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-07-22 03:14:12,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-07-22 03:14:12,711 INFO L293 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2022-07-22 03:14:12,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:14:12,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 03:14:12,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:14:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:14:12,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 03:14:12,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:14:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:14:12,839 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-07-22 03:14:12,840 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-07-22 03:14:12,894 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-07-22 03:14:12,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-07-22 03:14:12,898 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-07-22 03:14:12,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-07-22 03:14:12,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 03:14:12,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:14:12,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 03:14:12,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:14:12,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 5 letters. Loop has 4 letters. [2022-07-22 03:14:12,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:14:12,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 84 transitions. [2022-07-22 03:14:12,904 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-22 03:14:12,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 19 states and 26 transitions. [2022-07-22 03:14:12,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-22 03:14:12,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-22 03:14:12,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2022-07-22 03:14:12,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:14:12,907 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-22 03:14:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2022-07-22 03:14:12,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-22 03:14:12,942 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-07-22 03:14:12,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2022-07-22 03:14:12,944 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-22 03:14:12,944 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-22 03:14:12,944 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 03:14:12,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2022-07-22 03:14:12,945 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-22 03:14:12,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:14:12,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:14:12,945 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:14:12,945 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 03:14:12,945 INFO L752 eck$LassoCheckResult]: Stem: 165#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 166#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; 172#L532 assume !(main_~length1~0#1 < 1); 170#L532-2 assume !(main_~length2~0#1 < 1); 161#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; 162#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 173#L541-4 main_~i~1#1 := 0; 164#L547-3 [2022-07-22 03:14:12,946 INFO L754 eck$LassoCheckResult]: Loop: 164#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; 163#L547-2 main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 164#L547-3 [2022-07-22 03:14:12,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:12,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2022-07-22 03:14:12,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:12,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434632481] [2022-07-22 03:14:12,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:12,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:12,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:12,981 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:12,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:12,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:12,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2022-07-22 03:14:12,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:12,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144727679] [2022-07-22 03:14:12,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:12,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:13,007 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:13,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:13,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:13,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2022-07-22 03:14:13,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:13,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477741230] [2022-07-22 03:14:13,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:13,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:13,027 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:13,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:13,220 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 03:14:13,220 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 03:14:13,221 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 03:14:13,221 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 03:14:13,221 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 03:14:13,221 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:13,221 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 03:14:13,221 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 03:14:13,221 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration2_Lasso [2022-07-22 03:14:13,221 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 03:14:13,221 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 03:14:13,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:13,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:13,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:13,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:13,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:13,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:13,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:13,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:13,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:13,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:13,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:13,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-07-22 03:14:13,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:13,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:13,569 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 03:14:13,569 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 03:14:13,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:13,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:13,573 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-07-22 03:14:13,575 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-07-22 03:14:13,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:14:13,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:13,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:13,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:13,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:13,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:13,648 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:13,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:13,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:13,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:13,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:13,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:13,679 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-07-22 03:14:13,681 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-07-22 03:14:13,682 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-07-22 03:14:13,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:13,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:13,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:13,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:13,690 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:13,690 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:13,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:13,733 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-07-22 03:14:13,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:13,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:13,735 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-07-22 03:14:13,736 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-07-22 03:14:13,737 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-07-22 03:14:13,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:13,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:13,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:13,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:13,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:13,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:13,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:13,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:13,769 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-07-22 03:14:13,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:13,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:13,770 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-07-22 03:14:13,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 03:14:13,774 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-07-22 03:14:13,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:13,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:13,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:13,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:13,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:13,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:13,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:13,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:13,805 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-07-22 03:14:13,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:13,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:13,807 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-07-22 03:14:13,808 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-07-22 03:14:13,809 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-07-22 03:14:13,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:13,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:13,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:13,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:13,827 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:13,827 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:13,861 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:13,879 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-07-22 03:14:13,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:13,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:13,881 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-07-22 03:14:13,882 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-07-22 03:14:13,883 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-07-22 03:14:13,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:13,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:13,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:13,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:13,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:13,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:13,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:13,923 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-07-22 03:14:13,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:13,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:13,924 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-07-22 03:14:13,924 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-07-22 03:14:13,927 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-07-22 03:14:13,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:13,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:13,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:13,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:13,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:13,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:13,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:13,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:13,955 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-07-22 03:14:13,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:13,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:13,956 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-07-22 03:14:13,957 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-07-22 03:14:13,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:14:13,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:13,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:13,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:13,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:13,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:13,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:13,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:13,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:13,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-07-22 03:14:13,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:13,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:13,998 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-07-22 03:14:13,998 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-07-22 03:14:13,999 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-07-22 03:14:14,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:14,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:14,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:14,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:14,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:14,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:14,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:14,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:14,023 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-07-22 03:14:14,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:14,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:14,025 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-07-22 03:14:14,025 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-07-22 03:14:14,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:14:14,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:14,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:14,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:14,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:14,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:14,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:14,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:14,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:14,067 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-07-22 03:14:14,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:14,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:14,068 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-07-22 03:14:14,069 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-07-22 03:14:14,070 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-07-22 03:14:14,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:14,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:14,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:14,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:14,077 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:14,077 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:14,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:14,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-22 03:14:14,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:14,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:14,095 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-07-22 03:14:14,096 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-07-22 03:14:14,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:14:14,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:14,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:14,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:14,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:14,107 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:14,107 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:14,123 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 03:14:14,133 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-07-22 03:14:14,133 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-07-22 03:14:14,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:14,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:14,144 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-07-22 03:14:14,145 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-07-22 03:14:14,146 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 03:14:14,183 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 03:14:14,184 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 03:14:14,184 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-07-22 03:14:14,203 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-07-22 03:14:14,230 INFO L293 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-07-22 03:14:14,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:14,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:14:14,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 03:14:14,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:14:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:14:14,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 03:14:14,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:14:14,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:14:14,287 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-07-22 03:14:14,287 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-07-22 03:14:14,301 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-07-22 03:14:14,301 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-07-22 03:14:14,302 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-07-22 03:14:14,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-07-22 03:14:14,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 03:14:14,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:14:14,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-22 03:14:14,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:14:14,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-22 03:14:14,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:14:14,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 42 transitions. [2022-07-22 03:14:14,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-22 03:14:14,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 20 states and 28 transitions. [2022-07-22 03:14:14,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-22 03:14:14,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-22 03:14:14,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2022-07-22 03:14:14,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:14:14,305 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-07-22 03:14:14,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2022-07-22 03:14:14,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-22 03:14:14,307 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-07-22 03:14:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2022-07-22 03:14:14,307 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-07-22 03:14:14,307 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-07-22 03:14:14,307 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 03:14:14,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2022-07-22 03:14:14,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-22 03:14:14,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:14:14,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:14:14,308 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:14:14,308 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:14:14,309 INFO L752 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 288#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; 294#L532 assume !(main_~length1~0#1 < 1); 292#L532-2 assume !(main_~length2~0#1 < 1); 283#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; 284#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 295#L541-4 main_~i~1#1 := 0; 296#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 299#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; 298#L517-3 [2022-07-22 03:14:14,309 INFO L754 eck$LassoCheckResult]: Loop: 298#L517-3 call substring_#t~mem2#1 := read~int(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); 293#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; 291#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; 300#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; 289#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; 290#L520-6 call substring_#t~mem9#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1); 297#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; 298#L517-3 [2022-07-22 03:14:14,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:14,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2022-07-22 03:14:14,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:14,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333323715] [2022-07-22 03:14:14,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:14,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:14,333 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:14,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:14,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:14,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 1 times [2022-07-22 03:14:14,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:14,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61901951] [2022-07-22 03:14:14,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:14,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:14,353 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:14,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:14,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:14,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1515359350, now seen corresponding path program 1 times [2022-07-22 03:14:14,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:14,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038806145] [2022-07-22 03:14:14,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:14,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:14:14,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:14:14,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:14:14,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038806145] [2022-07-22 03:14:14,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038806145] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 03:14:14,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 03:14:14,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 03:14:14,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601931208] [2022-07-22 03:14:14,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 03:14:14,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:14:14,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 03:14:14,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-22 03:14:14,668 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-07-22 03:14:14,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:14:14,796 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-07-22 03:14:14,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 03:14:14,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2022-07-22 03:14:14,797 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2022-07-22 03:14:14,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 40 transitions. [2022-07-22 03:14:14,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-07-22 03:14:14,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-07-22 03:14:14,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2022-07-22 03:14:14,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:14:14,798 INFO L369 hiAutomatonCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-07-22 03:14:14,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2022-07-22 03:14:14,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-07-22 03:14:14,800 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-07-22 03:14:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-07-22 03:14:14,800 INFO L392 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-22 03:14:14,800 INFO L374 stractBuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-22 03:14:14,801 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 03:14:14,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2022-07-22 03:14:14,801 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2022-07-22 03:14:14,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:14:14,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:14:14,801 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:14:14,802 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:14:14,802 INFO L752 eck$LassoCheckResult]: Stem: 363#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 364#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; 370#L532 assume !(main_~length1~0#1 < 1); 367#L532-2 assume !(main_~length2~0#1 < 1); 359#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; 360#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 371#L541-4 main_~i~1#1 := 0; 372#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 376#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; 374#L517-3 [2022-07-22 03:14:14,802 INFO L754 eck$LassoCheckResult]: Loop: 374#L517-3 call substring_#t~mem2#1 := read~int(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); 368#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; 369#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; 377#L520-1 assume !substring_#t~short6#1; 378#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; 387#L520-6 call substring_#t~mem9#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1); 373#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; 374#L517-3 [2022-07-22 03:14:14,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:14,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 2 times [2022-07-22 03:14:14,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:14,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53675952] [2022-07-22 03:14:14,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:14,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:14,811 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:14,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:14,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:14,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1328800451, now seen corresponding path program 1 times [2022-07-22 03:14:14,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:14,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821665402] [2022-07-22 03:14:14,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:14,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:14:14,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:14:14,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:14:14,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821665402] [2022-07-22 03:14:14,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821665402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 03:14:14,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 03:14:14,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 03:14:14,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503638047] [2022-07-22 03:14:14,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 03:14:14,842 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 03:14:14,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:14:14,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 03:14:14,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 03:14:14,844 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-07-22 03:14:14,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:14:14,864 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-07-22 03:14:14,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 03:14:14,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2022-07-22 03:14:14,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-22 03:14:14,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 26 transitions. [2022-07-22 03:14:14,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-22 03:14:14,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-22 03:14:14,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2022-07-22 03:14:14,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:14:14,866 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-22 03:14:14,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2022-07-22 03:14:14,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-22 03:14:14,868 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-07-22 03:14:14,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-07-22 03:14:14,868 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-22 03:14:14,868 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-22 03:14:14,869 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 03:14:14,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2022-07-22 03:14:14,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-22 03:14:14,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:14:14,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:14:14,869 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:14:14,870 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:14:14,870 INFO L752 eck$LassoCheckResult]: Stem: 431#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 432#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; 439#L532 assume !(main_~length1~0#1 < 1); 438#L532-2 assume !(main_~length2~0#1 < 1); 429#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; 430#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 441#L541-4 main_~i~1#1 := 0; 442#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; 433#L547-2 main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 434#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 445#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; 444#L517-3 [2022-07-22 03:14:14,870 INFO L754 eck$LassoCheckResult]: Loop: 444#L517-3 call substring_#t~mem2#1 := read~int(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); 440#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; 437#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; 446#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; 435#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; 436#L520-6 call substring_#t~mem9#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1); 443#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; 444#L517-3 [2022-07-22 03:14:14,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:14,870 INFO L85 PathProgramCache]: Analyzing trace with hash -2087704584, now seen corresponding path program 1 times [2022-07-22 03:14:14,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:14,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737133517] [2022-07-22 03:14:14,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:14,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:14,889 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:14,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:14,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:14,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 2 times [2022-07-22 03:14:14,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:14,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126553733] [2022-07-22 03:14:14,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:14,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:14,903 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:14,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:14,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:14,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1823246168, now seen corresponding path program 1 times [2022-07-22 03:14:14,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:14,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844885199] [2022-07-22 03:14:14,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:14,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:14:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 03:14:15,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:14:15,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844885199] [2022-07-22 03:14:15,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844885199] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 03:14:15,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 03:14:15,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 03:14:15,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663707393] [2022-07-22 03:14:15,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 03:14:15,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:14:15,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 03:14:15,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-22 03:14:15,156 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-07-22 03:14:15,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:14:15,203 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-07-22 03:14:15,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 03:14:15,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 34 transitions. [2022-07-22 03:14:15,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-22 03:14:15,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 26 transitions. [2022-07-22 03:14:15,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-22 03:14:15,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-22 03:14:15,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2022-07-22 03:14:15,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:14:15,205 INFO L369 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-07-22 03:14:15,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2022-07-22 03:14:15,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-07-22 03:14:15,206 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-07-22 03:14:15,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-07-22 03:14:15,206 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-22 03:14:15,207 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-22 03:14:15,207 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 03:14:15,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2022-07-22 03:14:15,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-22 03:14:15,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:14:15,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:14:15,208 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:14:15,208 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:14:15,208 INFO L752 eck$LassoCheckResult]: Stem: 495#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 496#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; 504#L532 assume !(main_~length1~0#1 < 1); 502#L532-2 assume !(main_~length2~0#1 < 1); 493#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; 494#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; 511#L541-2 main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 512#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 505#L541-4 main_~i~1#1 := 0; 506#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; 497#L547-2 main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 498#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 509#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; 508#L517-3 [2022-07-22 03:14:15,208 INFO L754 eck$LassoCheckResult]: Loop: 508#L517-3 call substring_#t~mem2#1 := read~int(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); 503#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; 501#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; 510#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; 499#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; 500#L520-6 call substring_#t~mem9#1 := read~int(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1); 507#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; 508#L517-3 [2022-07-22 03:14:15,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:15,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2022-07-22 03:14:15,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:15,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708632328] [2022-07-22 03:14:15,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:15,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:15,223 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:15,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:15,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:15,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 3 times [2022-07-22 03:14:15,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:15,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708972088] [2022-07-22 03:14:15,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:15,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:15,243 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:15,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:15,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:15,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1498710394, now seen corresponding path program 1 times [2022-07-22 03:14:15,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:15,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413260157] [2022-07-22 03:14:15,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:15,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:15,285 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:15,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:16,036 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 03:14:16,036 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 03:14:16,036 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 03:14:16,036 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 03:14:16,036 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 03:14:16,036 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:16,036 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 03:14:16,036 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 03:14:16,036 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration6_Lasso [2022-07-22 03:14:16,036 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 03:14:16,036 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 03:14:16,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,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-07-22 03:14:16,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,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-07-22 03:14:16,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:16,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:17,111 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 03:14:17,112 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 03:14:17,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:17,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:17,113 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-07-22 03:14:17,114 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-07-22 03:14:17,115 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-07-22 03:14:17,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:17,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:17,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:17,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:17,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:17,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:17,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:17,124 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:17,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-22 03:14:17,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:17,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:17,141 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-07-22 03:14:17,141 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-07-22 03:14:17,143 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-07-22 03:14:17,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:17,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:17,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:17,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:17,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:17,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:17,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:17,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:17,165 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-07-22 03:14:17,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:17,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:17,167 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-07-22 03:14:17,173 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-07-22 03:14:17,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:14:17,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:17,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:17,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:17,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:17,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:17,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:17,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:17,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:17,210 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-07-22 03:14:17,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:17,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:17,212 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-07-22 03:14:17,212 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-07-22 03:14:17,214 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-07-22 03:14:17,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:17,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:17,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:17,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:17,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:17,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:17,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:17,222 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:17,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-22 03:14:17,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:17,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:17,239 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-07-22 03:14:17,239 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-07-22 03:14:17,241 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-07-22 03:14:17,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:17,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:17,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:17,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:17,249 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:17,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:17,259 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:17,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-22 03:14:17,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:17,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:17,277 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-07-22 03:14:17,277 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-07-22 03:14:17,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-07-22 03:14:17,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:17,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:17,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:17,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:17,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:17,296 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:17,313 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 03:14:17,344 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-22 03:14:17,344 INFO L444 ModelExtractionUtils]: 41 out of 61 variables were initially zero. Simplification set additionally 17 variables to zero. [2022-07-22 03:14:17,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:17,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:17,346 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-07-22 03:14:17,347 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-07-22 03:14:17,348 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 03:14:17,379 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 03:14:17,380 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 03:14:17,380 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_substring_~ps~0#1.base)_1, ULTIMATE.start_substring_~ps~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_substring_~ps~0#1.base)_1 - 1*ULTIMATE.start_substring_~ps~0#1.offset Supporting invariants [] [2022-07-22 03:14:17,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:17,441 INFO L293 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2022-07-22 03:14:17,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:14:17,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 03:14:17,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:14:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:14:17,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 03:14:17,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:14:17,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:14:17,528 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-07-22 03:14:17,528 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-07-22 03:14:17,540 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-07-22 03:14:17,541 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-07-22 03:14:17,541 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-07-22 03:14:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-07-22 03:14:17,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 7 letters. [2022-07-22 03:14:17,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:14:17,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 20 letters. Loop has 7 letters. [2022-07-22 03:14:17,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:14:17,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 14 letters. [2022-07-22 03:14:17,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:14:17,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2022-07-22 03:14:17,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 03:14:17,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 32 transitions. [2022-07-22 03:14:17,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-22 03:14:17,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-07-22 03:14:17,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2022-07-22 03:14:17,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 03:14:17,544 INFO L369 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-07-22 03:14:17,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2022-07-22 03:14:17,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-22 03:14:17,545 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-07-22 03:14:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-07-22 03:14:17,545 INFO L392 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-07-22 03:14:17,545 INFO L374 stractBuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-07-22 03:14:17,546 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 03:14:17,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2022-07-22 03:14:17,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 03:14:17,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:14:17,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:14:17,546 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:14:17,547 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 03:14:17,547 INFO L752 eck$LassoCheckResult]: Stem: 686#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 687#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; 696#L532 assume !(main_~length1~0#1 < 1); 695#L532-2 assume !(main_~length2~0#1 < 1); 684#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; 685#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; 707#L541-2 main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 708#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 699#L541-4 main_~i~1#1 := 0; 700#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; 688#L547-2 main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 689#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 703#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; 704#L517-3 call substring_#t~mem2#1 := read~int(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); 697#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; 691#L520-5 [2022-07-22 03:14:17,547 INFO L754 eck$LassoCheckResult]: Loop: 691#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; 705#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; 690#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; 691#L520-5 [2022-07-22 03:14:17,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:17,547 INFO L85 PathProgramCache]: Analyzing trace with hash 2055034719, now seen corresponding path program 1 times [2022-07-22 03:14:17,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:17,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872576638] [2022-07-22 03:14:17,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:17,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:17,557 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:17,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:17,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:17,566 INFO L85 PathProgramCache]: Analyzing trace with hash 87489, now seen corresponding path program 1 times [2022-07-22 03:14:17,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:17,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124905926] [2022-07-22 03:14:17,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:17,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:17,570 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:17,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:17,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:17,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1075534243, now seen corresponding path program 1 times [2022-07-22 03:14:17,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:17,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580259741] [2022-07-22 03:14:17,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:17,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:17,584 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:17,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:17,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:18,597 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 03:14:18,597 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 03:14:18,597 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 03:14:18,597 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 03:14:18,597 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 03:14:18,597 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:18,597 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 03:14:18,597 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 03:14:18,597 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration7_Lasso [2022-07-22 03:14:18,597 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 03:14:18,598 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 03:14:18,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-07-22 03:14:18,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:18,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:18,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:18,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:18,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:18,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:18,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:18,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:18,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:18,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:18,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:18,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:18,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:18,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:18,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:18,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:18,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:18,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:18,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:18,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:18,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-07-22 03:14:18,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:18,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-07-22 03:14:18,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:18,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:18,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:14:19,263 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) 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:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) 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-07-22 03:14:19,265 INFO L158 Benchmark]: Toolchain (without parser) took 9016.80ms. Allocated memory was 54.5MB in the beginning and 119.5MB in the end (delta: 65.0MB). Free memory was 30.7MB in the beginning and 86.8MB in the end (delta: -56.2MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2022-07-22 03:14:19,265 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 54.5MB. Free memory is still 36.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 03:14:19,266 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.65ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 30.4MB in the beginning and 45.0MB in the end (delta: -14.6MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2022-07-22 03:14:19,266 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.13ms. Allocated memory is still 67.1MB. Free memory was 44.8MB in the beginning and 42.9MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 03:14:19,266 INFO L158 Benchmark]: Boogie Preprocessor took 40.08ms. Allocated memory is still 67.1MB. Free memory was 42.9MB in the beginning and 41.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 03:14:19,266 INFO L158 Benchmark]: RCFGBuilder took 352.81ms. Allocated memory is still 67.1MB. Free memory was 41.4MB in the beginning and 44.0MB in the end (delta: -2.6MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2022-07-22 03:14:19,267 INFO L158 Benchmark]: BuchiAutomizer took 8209.49ms. Allocated memory was 67.1MB in the beginning and 119.5MB in the end (delta: 52.4MB). Free memory was 44.0MB in the beginning and 86.8MB in the end (delta: -42.8MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. [2022-07-22 03:14:19,268 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 54.5MB. Free memory is still 36.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.65ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 30.4MB in the beginning and 45.0MB in the end (delta: -14.6MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.13ms. Allocated memory is still 67.1MB. Free memory was 44.8MB in the beginning and 42.9MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.08ms. Allocated memory is still 67.1MB. Free memory was 42.9MB in the beginning and 41.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 352.81ms. Allocated memory is still 67.1MB. Free memory was 41.4MB in the beginning and 44.0MB in the end (delta: -2.6MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 8209.49ms. Allocated memory was 67.1MB in the beginning and 119.5MB in the end (delta: 52.4MB). Free memory was 44.0MB in the beginning and 86.8MB in the end (delta: -42.8MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 03:14:19,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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: IllegalArgumentException: null