./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 6c24879c 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-?-6c24879 [2022-07-13 04:54:17,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 04:54:17,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 04:54:17,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 04:54:17,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 04:54:17,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 04:54:17,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 04:54:17,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 04:54:17,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 04:54:17,840 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 04:54:17,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 04:54:17,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 04:54:17,843 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 04:54:17,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 04:54:17,845 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 04:54:17,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 04:54:17,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 04:54:17,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 04:54:17,849 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 04:54:17,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 04:54:17,854 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 04:54:17,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 04:54:17,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 04:54:17,856 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 04:54:17,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 04:54:17,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 04:54:17,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 04:54:17,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 04:54:17,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 04:54:17,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 04:54:17,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 04:54:17,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 04:54:17,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 04:54:17,865 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 04:54:17,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 04:54:17,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 04:54:17,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 04:54:17,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 04:54:17,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 04:54:17,867 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 04:54:17,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 04:54:17,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 04:54:17,869 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 04:54:17,892 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 04:54:17,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 04:54:17,892 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 04:54:17,892 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 04:54:17,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 04:54:17,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 04:54:17,894 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 04:54:17,894 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 04:54:17,894 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 04:54:17,895 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 04:54:17,895 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 04:54:17,895 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 04:54:17,895 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 04:54:17,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 04:54:17,895 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 04:54:17,896 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 04:54:17,896 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 04:54:17,896 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 04:54:17,896 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 04:54:17,896 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 04:54:17,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 04:54:17,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 04:54:17,896 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 04:54:17,897 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 04:54:17,897 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 04:54:17,897 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 04:54:17,897 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 04:54:17,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 04:54:17,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 04:54:17,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 04:54:17,898 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 04:54:17,898 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 04:54:17,898 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-13 04:54:18,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 04:54:18,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 04:54:18,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 04:54:18,106 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 04:54:18,106 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 04:54:18,107 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-13 04:54:18,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4db9b5e37/d74322c194a94e41a7e02ec2d1d02ad0/FLAG8bec09c55 [2022-07-13 04:54:18,521 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 04:54:18,522 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2022-07-13 04:54:18,528 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4db9b5e37/d74322c194a94e41a7e02ec2d1d02ad0/FLAG8bec09c55 [2022-07-13 04:54:18,933 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4db9b5e37/d74322c194a94e41a7e02ec2d1d02ad0 [2022-07-13 04:54:18,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 04:54:18,935 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 04:54:18,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 04:54:18,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 04:54:18,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 04:54:18,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:54:18" (1/1) ... [2022-07-13 04:54:18,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e06d274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:18, skipping insertion in model container [2022-07-13 04:54:18,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:54:18" (1/1) ... [2022-07-13 04:54:18,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 04:54:18,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 04:54:19,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:54:19,183 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 04:54:19,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:54:19,229 INFO L208 MainTranslator]: Completed translation [2022-07-13 04:54:19,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:19 WrapperNode [2022-07-13 04:54:19,229 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 04:54:19,230 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 04:54:19,230 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 04:54:19,230 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 04:54:19,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:19" (1/1) ... [2022-07-13 04:54:19,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:19" (1/1) ... [2022-07-13 04:54:19,256 INFO L137 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2022-07-13 04:54:19,256 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 04:54:19,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 04:54:19,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 04:54:19,257 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 04:54:19,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:19" (1/1) ... [2022-07-13 04:54:19,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:19" (1/1) ... [2022-07-13 04:54:19,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:19" (1/1) ... [2022-07-13 04:54:19,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:19" (1/1) ... [2022-07-13 04:54:19,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:19" (1/1) ... [2022-07-13 04:54:19,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:19" (1/1) ... [2022-07-13 04:54:19,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:19" (1/1) ... [2022-07-13 04:54:19,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 04:54:19,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 04:54:19,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 04:54:19,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 04:54:19,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:19" (1/1) ... [2022-07-13 04:54:19,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:19,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:19,297 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-13 04:54:19,298 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-13 04:54:19,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 04:54:19,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 04:54:19,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 04:54:19,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 04:54:19,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 04:54:19,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 04:54:19,389 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 04:54:19,390 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 04:54:19,540 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 04:54:19,544 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 04:54:19,544 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 04:54:19,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:54:19 BoogieIcfgContainer [2022-07-13 04:54:19,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 04:54:19,546 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 04:54:19,546 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 04:54:19,551 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 04:54:19,552 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:54:19,552 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 04:54:18" (1/3) ... [2022-07-13 04:54:19,555 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cb7584e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:54:19, skipping insertion in model container [2022-07-13 04:54:19,556 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:54:19,556 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:19" (2/3) ... [2022-07-13 04:54:19,556 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cb7584e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:54:19, skipping insertion in model container [2022-07-13 04:54:19,556 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:54:19,556 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:54:19" (3/3) ... [2022-07-13 04:54:19,557 INFO L354 chiAutomizerObserver]: Analyzing ICFG substring-alloca-2.i [2022-07-13 04:54:19,595 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 04:54:19,595 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 04:54:19,595 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 04:54:19,595 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 04:54:19,595 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 04:54:19,595 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 04:54:19,596 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 04:54:19,596 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 04:54:19,599 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-13 04:54:19,610 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-07-13 04:54:19,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:19,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:19,614 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 04:54:19,614 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:54:19,615 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 04:54:19,615 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-13 04:54:19,616 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-07-13 04:54:19,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:19,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:19,617 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 04:54:19,617 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:54:19,621 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-13 04:54:19,621 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-13 04:54:19,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:19,625 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-07-13 04:54:19,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:19,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464595710] [2022-07-13 04:54:19,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:19,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:19,690 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:19,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:19,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:19,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-07-13 04:54:19,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:19,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369694693] [2022-07-13 04:54:19,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:19,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:19,758 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:19,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:19,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:19,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-07-13 04:54:19,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:19,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965970658] [2022-07-13 04:54:19,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:19,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:19,783 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:19,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:20,078 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:54:20,078 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:54:20,078 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:54:20,078 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:54:20,078 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:54:20,079 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:20,079 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:54:20,079 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:54:20,079 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration1_Lasso [2022-07-13 04:54:20,079 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:54:20,080 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:54:20,094 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-13 04:54:20,098 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-13 04:54:20,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:20,101 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-13 04:54:20,102 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-13 04:54:20,106 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-13 04:54:20,108 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-13 04:54:20,251 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-13 04:54:20,253 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-13 04:54:20,254 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-13 04:54:20,256 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-13 04:54:20,260 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-13 04:54:20,261 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-13 04:54:20,263 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-13 04:54:20,265 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-13 04:54:20,446 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:54:20,448 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:54:20,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:20,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:20,451 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-13 04:54:20,461 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-13 04:54:20,463 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-13 04:54:20,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:20,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:20,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:20,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:20,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:20,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:20,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:20,489 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:20,504 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-13 04:54:20,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:20,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:20,507 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-13 04:54:20,508 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-13 04:54:20,509 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-13 04:54:20,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:20,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:20,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:20,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:20,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:20,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:20,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:20,523 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:20,540 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-13 04:54:20,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:20,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:20,542 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-13 04:54:20,542 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-13 04:54:20,544 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-13 04:54:20,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:20,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:20,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:20,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:20,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:20,551 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:20,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:20,562 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:20,577 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-13 04:54:20,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:20,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:20,579 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-13 04:54:20,579 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-13 04:54:20,581 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-13 04:54:20,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:20,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:20,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:20,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:20,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:20,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:20,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:20,589 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:20,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-13 04:54:20,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:20,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:20,607 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-13 04:54:20,608 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-13 04:54:20,609 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-13 04:54:20,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:20,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:20,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:20,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:20,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:20,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:20,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:20,650 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-13 04:54:20,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:20,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:20,659 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-13 04:54:20,660 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-13 04:54:20,661 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-13 04:54:20,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:20,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:20,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:20,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:20,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:20,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:20,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:20,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-13 04:54:20,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:20,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:20,702 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-13 04:54:20,703 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-13 04:54:20,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:54:20,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:20,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:20,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:20,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:20,715 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:20,715 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:20,725 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:20,741 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-13 04:54:20,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:20,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:20,742 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-13 04:54:20,743 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-13 04:54:20,747 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-13 04:54:20,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:20,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:20,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:20,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:20,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:20,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:20,772 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:20,791 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-13 04:54:20,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:20,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:20,792 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-13 04:54:20,793 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-13 04:54:20,794 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-13 04:54:20,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:20,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:20,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:20,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:20,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:20,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:20,818 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:20,834 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-13 04:54:20,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:20,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:20,835 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-13 04:54:20,841 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-13 04:54:20,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:20,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:20,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:20,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:20,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:20,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:20,860 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-13 04:54:20,865 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:54:20,891 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2022-07-13 04:54:20,891 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-13 04:54:20,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:20,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:20,894 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-13 04:54:20,895 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-13 04:54:20,896 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:54:20,913 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-13 04:54:20,913 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:54:20,914 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1) = -1*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1 Supporting invariants [1*ULTIMATE.start_main_~nondetString1~0#1.offset >= 0] [2022-07-13 04:54:20,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-13 04:54:20,961 INFO L293 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2022-07-13 04:54:21,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:21,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:54:21,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:54:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:21,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 04:54:21,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:54:21,063 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-13 04:54:21,088 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-13 04:54:21,089 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-13 04:54:21,147 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-13 04:54:21,148 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-13 04:54:21,151 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-13 04:54:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-07-13 04:54:21,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-13 04:54:21,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:54:21,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-13 04:54:21,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:54:21,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 5 letters. Loop has 4 letters. [2022-07-13 04:54:21,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:54:21,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 84 transitions. [2022-07-13 04:54:21,157 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-13 04:54:21,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 19 states and 26 transitions. [2022-07-13 04:54:21,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-13 04:54:21,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-13 04:54:21,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2022-07-13 04:54:21,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:54:21,160 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-13 04:54:21,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2022-07-13 04:54:21,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-13 04:54:21,178 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-13 04:54:21,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2022-07-13 04:54:21,179 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-13 04:54:21,179 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-13 04:54:21,180 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 04:54:21,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2022-07-13 04:54:21,180 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-13 04:54:21,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:21,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:21,181 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:21,181 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:54:21,182 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-13 04:54:21,182 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-13 04:54:21,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:21,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2022-07-13 04:54:21,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:21,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891073441] [2022-07-13 04:54:21,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:21,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:21,194 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:21,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:21,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:21,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2022-07-13 04:54:21,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:21,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816793202] [2022-07-13 04:54:21,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:21,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:21,208 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:21,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:21,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:21,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2022-07-13 04:54:21,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:21,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508480677] [2022-07-13 04:54:21,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:21,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:21,228 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:21,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:21,334 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-13 04:54:21,452 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:54:21,452 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:54:21,452 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:54:21,452 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:54:21,452 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:54:21,453 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:21,453 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:54:21,453 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:54:21,453 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration2_Lasso [2022-07-13 04:54:21,453 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:54:21,453 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:54:21,456 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-13 04:54:21,457 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-13 04:54:21,459 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-13 04:54:21,461 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-13 04:54:21,463 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-13 04:54:21,465 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-13 04:54:21,467 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-13 04:54:21,469 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-13 04:54:21,470 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-13 04:54:21,472 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-13 04:54:21,473 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-13 04:54:21,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:21,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:21,586 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-13 04:54:21,752 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:54:21,752 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:54:21,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:21,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:21,756 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-13 04:54:21,758 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-13 04:54:21,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:54:21,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:21,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:21,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:21,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:21,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:21,766 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:21,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:21,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:21,815 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-13 04:54:21,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:21,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:21,817 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-13 04:54:21,818 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-13 04:54:21,820 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-13 04:54:21,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:21,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:21,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:21,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:21,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:21,831 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:21,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:21,859 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-13 04:54:21,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:21,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:21,864 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-13 04:54:21,865 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-13 04:54:21,866 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-13 04:54:21,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:21,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:21,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:21,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:21,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:21,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:21,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:21,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:21,906 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-13 04:54:21,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:21,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:21,908 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-13 04:54:21,911 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-13 04:54:21,911 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-13 04:54:21,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:21,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:21,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:21,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:21,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:21,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:21,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:21,924 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:21,939 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-13 04:54:21,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:21,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:21,941 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-13 04:54:21,941 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-13 04:54:21,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:54:21,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:21,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:21,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:21,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:21,949 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:21,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:21,969 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:21,991 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-13 04:54:21,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:21,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:21,994 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-13 04:54:21,995 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-13 04:54:21,996 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-13 04:54:22,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:22,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:22,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:22,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:22,007 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:22,007 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:22,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:22,036 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-13 04:54:22,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:22,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:22,045 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-13 04:54:22,046 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-13 04:54:22,047 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-13 04:54:22,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:22,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:22,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:22,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:22,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:22,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:22,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:22,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:22,084 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-13 04:54:22,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:22,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:22,088 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-13 04:54:22,089 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-13 04:54:22,090 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-13 04:54:22,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:22,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:22,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:22,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:22,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:22,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:22,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:22,106 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:22,125 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-13 04:54:22,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:22,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:22,126 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-13 04:54:22,127 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-13 04:54:22,128 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-13 04:54:22,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:22,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:22,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:22,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:22,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:22,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:22,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:22,136 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:22,151 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-13 04:54:22,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:22,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:22,152 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-13 04:54:22,152 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-13 04:54:22,154 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-13 04:54:22,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:22,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:22,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:22,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:22,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:22,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:22,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:22,176 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:22,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-13 04:54:22,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:22,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:22,213 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-13 04:54:22,214 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-13 04:54:22,216 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-13 04:54:22,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:22,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:22,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:22,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:22,235 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:22,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:22,245 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:22,260 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-13 04:54:22,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:22,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:22,262 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-13 04:54:22,262 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-13 04:54:22,264 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-13 04:54:22,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:22,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:22,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:22,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:22,277 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:22,277 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:22,291 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:54:22,308 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-07-13 04:54:22,309 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-07-13 04:54:22,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:22,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:22,312 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-13 04:54:22,313 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-13 04:54:22,314 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:54:22,334 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 04:54:22,335 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:54:22,335 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-13 04:54:22,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-13 04:54:22,366 INFO L293 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-07-13 04:54:22,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:22,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:54:22,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:54:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:22,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:54:22,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:54:22,418 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-13 04:54:22,419 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-13 04:54:22,419 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-13 04:54:22,434 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-13 04:54:22,435 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-13 04:54:22,435 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-13 04:54:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-07-13 04:54:22,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-13 04:54:22,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:54:22,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-13 04:54:22,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:54:22,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-13 04:54:22,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:54:22,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 42 transitions. [2022-07-13 04:54:22,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-13 04:54:22,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 20 states and 28 transitions. [2022-07-13 04:54:22,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-13 04:54:22,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-13 04:54:22,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2022-07-13 04:54:22,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:54:22,438 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-07-13 04:54:22,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2022-07-13 04:54:22,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-13 04:54:22,439 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-13 04:54:22,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2022-07-13 04:54:22,439 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-07-13 04:54:22,439 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-07-13 04:54:22,439 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 04:54:22,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2022-07-13 04:54:22,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-13 04:54:22,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:22,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:22,440 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:22,441 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:22,441 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-13 04:54:22,441 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-13 04:54:22,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:22,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2022-07-13 04:54:22,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:22,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483263492] [2022-07-13 04:54:22,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:22,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:22,455 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:22,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:22,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:22,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 1 times [2022-07-13 04:54:22,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:22,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548307123] [2022-07-13 04:54:22,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:22,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:22,471 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:22,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:22,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:22,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1515359350, now seen corresponding path program 1 times [2022-07-13 04:54:22,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:22,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236098225] [2022-07-13 04:54:22,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:22,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:22,609 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-13 04:54:22,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:54:22,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236098225] [2022-07-13 04:54:22,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236098225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:54:22,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:54:22,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 04:54:22,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711282340] [2022-07-13 04:54:22,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:54:22,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:54:22,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 04:54:22,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-13 04:54:22,768 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-13 04:54:22,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:54:22,915 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-07-13 04:54:22,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 04:54:22,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2022-07-13 04:54:22,917 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2022-07-13 04:54:22,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 40 transitions. [2022-07-13 04:54:22,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-07-13 04:54:22,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-07-13 04:54:22,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2022-07-13 04:54:22,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:54:22,918 INFO L369 hiAutomatonCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-07-13 04:54:22,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2022-07-13 04:54:22,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-07-13 04:54:22,919 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-13 04:54:22,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-07-13 04:54:22,920 INFO L392 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-13 04:54:22,920 INFO L374 stractBuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-13 04:54:22,920 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 04:54:22,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2022-07-13 04:54:22,920 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2022-07-13 04:54:22,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:22,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:22,921 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:22,921 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:22,921 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-13 04:54:22,921 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-13 04:54:22,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:22,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 2 times [2022-07-13 04:54:22,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:22,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193384690] [2022-07-13 04:54:22,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:22,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:22,932 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:22,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:22,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:22,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1328800451, now seen corresponding path program 1 times [2022-07-13 04:54:22,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:22,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295065412] [2022-07-13 04:54:22,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:22,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:22,948 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-13 04:54:22,963 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-13 04:54:22,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:54:22,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295065412] [2022-07-13 04:54:22,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295065412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:54:22,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:54:22,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 04:54:22,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785939050] [2022-07-13 04:54:22,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:54:22,964 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:54:22,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:54:22,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 04:54:22,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 04:54:22,965 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-13 04:54:22,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:54:22,988 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-07-13 04:54:22,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 04:54:22,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2022-07-13 04:54:22,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-13 04:54:22,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 26 transitions. [2022-07-13 04:54:22,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-13 04:54:22,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-13 04:54:22,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2022-07-13 04:54:22,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:54:22,994 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-13 04:54:22,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2022-07-13 04:54:22,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-13 04:54:22,995 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-13 04:54:22,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-07-13 04:54:22,996 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-13 04:54:22,996 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-13 04:54:22,996 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 04:54:22,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2022-07-13 04:54:22,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-13 04:54:22,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:22,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:22,999 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:22,999 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:22,999 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-13 04:54:22,999 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-13 04:54:22,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:22,999 INFO L85 PathProgramCache]: Analyzing trace with hash -2087704584, now seen corresponding path program 1 times [2022-07-13 04:54:22,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:23,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496897426] [2022-07-13 04:54:23,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:23,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:23,010 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:23,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:23,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:23,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 2 times [2022-07-13 04:54:23,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:23,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769129758] [2022-07-13 04:54:23,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:23,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:23,027 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:23,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:23,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:23,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1823246168, now seen corresponding path program 1 times [2022-07-13 04:54:23,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:23,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877369740] [2022-07-13 04:54:23,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:23,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:23,125 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-13 04:54:23,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:54:23,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877369740] [2022-07-13 04:54:23,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877369740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:54:23,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:54:23,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 04:54:23,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387473354] [2022-07-13 04:54:23,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:54:23,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:54:23,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 04:54:23,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 04:54:23,258 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-13 04:54:23,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:54:23,304 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-07-13 04:54:23,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 04:54:23,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 34 transitions. [2022-07-13 04:54:23,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-13 04:54:23,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 26 transitions. [2022-07-13 04:54:23,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-13 04:54:23,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-13 04:54:23,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2022-07-13 04:54:23,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:54:23,306 INFO L369 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-07-13 04:54:23,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2022-07-13 04:54:23,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-07-13 04:54:23,307 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-13 04:54:23,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-07-13 04:54:23,308 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-13 04:54:23,308 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-13 04:54:23,308 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 04:54:23,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2022-07-13 04:54:23,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-13 04:54:23,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:23,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:23,308 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:23,308 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:23,309 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-13 04:54:23,309 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-13 04:54:23,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:23,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2022-07-13 04:54:23,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:23,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678488160] [2022-07-13 04:54:23,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:23,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:23,332 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:23,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:23,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:23,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 3 times [2022-07-13 04:54:23,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:23,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022174999] [2022-07-13 04:54:23,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:23,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:23,347 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:23,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:23,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:23,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1498710394, now seen corresponding path program 1 times [2022-07-13 04:54:23,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:23,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654265167] [2022-07-13 04:54:23,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:23,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:23,361 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:23,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:24,101 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:54:24,101 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:54:24,101 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:54:24,101 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:54:24,101 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:54:24,101 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:24,101 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:54:24,101 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:54:24,101 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration6_Lasso [2022-07-13 04:54:24,101 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:54:24,101 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:54:24,104 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-13 04:54:24,105 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-13 04:54:24,106 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-13 04:54:24,108 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-13 04:54:24,109 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-13 04:54:24,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-13 04:54:24,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-13 04:54:24,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-13 04:54:24,609 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-13 04:54:24,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-13 04:54:24,612 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-13 04:54:24,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-13 04:54:24,614 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-13 04:54:24,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-13 04:54:24,618 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-13 04:54:24,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-13 04:54:24,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-13 04:54:24,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-13 04:54:24,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-13 04:54:24,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-13 04:54:24,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-13 04:54:24,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-13 04:54:24,628 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-13 04:54:24,630 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-13 04:54:24,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-13 04:54:24,634 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-13 04:54:24,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-13 04:54:25,116 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:54:25,116 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:54:25,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:25,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:25,118 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-13 04:54:25,119 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-13 04:54:25,120 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-13 04:54:25,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:25,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:25,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:25,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:25,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:25,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:25,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:25,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:25,143 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-13 04:54:25,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:25,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:25,144 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-13 04:54:25,144 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-13 04:54:25,146 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-13 04:54:25,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:25,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:25,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:25,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:25,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:25,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:25,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:25,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:25,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-13 04:54:25,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:25,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:25,192 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-13 04:54:25,193 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-13 04:54:25,194 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-13 04:54:25,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:25,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:25,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:25,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:25,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:25,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:25,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:25,203 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:25,219 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-13 04:54:25,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:25,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:25,220 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-13 04:54:25,220 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-13 04:54:25,222 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-13 04:54:25,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:25,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:25,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:25,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:25,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:25,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:25,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:25,237 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:25,252 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-13 04:54:25,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:25,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:25,254 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-13 04:54:25,254 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-13 04:54:25,256 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-13 04:54:25,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:25,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:25,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:25,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:25,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:25,263 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:25,265 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:25,280 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-13 04:54:25,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:25,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:25,281 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-13 04:54:25,282 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-13 04:54:25,283 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-13 04:54:25,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:25,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:25,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:25,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:25,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:25,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:25,332 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:54:25,364 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-13 04:54:25,364 INFO L444 ModelExtractionUtils]: 41 out of 61 variables were initially zero. Simplification set additionally 17 variables to zero. [2022-07-13 04:54:25,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:25,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:25,366 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-13 04:54:25,367 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-13 04:54:25,368 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:54:25,389 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 04:54:25,389 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:54:25,389 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-13 04:54:25,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-13 04:54:25,448 INFO L293 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2022-07-13 04:54:25,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:25,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:54:25,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:54:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:25,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 04:54:25,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:54:25,529 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-13 04:54:25,530 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-13 04:54:25,530 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-13 04:54:25,541 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-13 04:54:25,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-13 04:54:25,542 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-13 04:54:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-07-13 04:54:25,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 7 letters. [2022-07-13 04:54:25,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:54:25,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 20 letters. Loop has 7 letters. [2022-07-13 04:54:25,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:54:25,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 14 letters. [2022-07-13 04:54:25,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:54:25,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2022-07-13 04:54:25,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 04:54:25,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 32 transitions. [2022-07-13 04:54:25,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-13 04:54:25,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-07-13 04:54:25,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2022-07-13 04:54:25,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:54:25,544 INFO L369 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-07-13 04:54:25,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2022-07-13 04:54:25,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-13 04:54:25,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-13 04:54:25,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-07-13 04:54:25,545 INFO L392 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-07-13 04:54:25,546 INFO L374 stractBuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-07-13 04:54:25,546 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 04:54:25,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2022-07-13 04:54:25,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 04:54:25,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:25,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:25,546 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:25,547 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 04:54:25,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-13 04:54:25,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-13 04:54:25,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:25,547 INFO L85 PathProgramCache]: Analyzing trace with hash 2055034719, now seen corresponding path program 1 times [2022-07-13 04:54:25,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:25,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978270637] [2022-07-13 04:54:25,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:25,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:25,559 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:25,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:25,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:25,567 INFO L85 PathProgramCache]: Analyzing trace with hash 87489, now seen corresponding path program 1 times [2022-07-13 04:54:25,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:25,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94188118] [2022-07-13 04:54:25,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:25,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:25,570 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:25,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:25,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:25,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1075534243, now seen corresponding path program 1 times [2022-07-13 04:54:25,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:25,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019395415] [2022-07-13 04:54:25,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:25,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:25,582 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:25,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:25,691 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-13 04:54:26,651 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:54:26,651 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:54:26,651 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:54:26,651 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:54:26,651 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:54:26,652 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:26,652 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:54:26,652 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:54:26,652 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration7_Lasso [2022-07-13 04:54:26,652 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:54:26,652 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:54:26,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-13 04:54:26,659 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-13 04:54:26,661 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-13 04:54:26,662 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-13 04:54:26,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:26,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:26,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:26,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:26,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:26,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:26,674 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-13 04:54:26,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:26,676 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-13 04:54:26,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:26,678 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-13 04:54:26,680 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-13 04:54:26,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:26,682 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-13 04:54:26,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:26,684 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-13 04:54:26,686 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-13 04:54:26,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:26,697 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-13 04:54:26,698 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-13 04:54:26,699 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-13 04:54:26,701 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-13 04:54:26,702 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-13 04:54:27,309 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-13 04:54:27,312 INFO L158 Benchmark]: Toolchain (without parser) took 8376.44ms. Allocated memory was 90.2MB in the beginning and 159.4MB in the end (delta: 69.2MB). Free memory was 52.6MB in the beginning and 72.7MB in the end (delta: -20.1MB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB. [2022-07-13 04:54:27,313 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 90.2MB. Free memory is still 69.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:54:27,313 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.60ms. Allocated memory is still 90.2MB. Free memory was 52.3MB in the beginning and 58.8MB in the end (delta: -6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 04:54:27,313 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.79ms. Allocated memory is still 90.2MB. Free memory was 58.8MB in the beginning and 56.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:54:27,313 INFO L158 Benchmark]: Boogie Preprocessor took 16.96ms. Allocated memory is still 90.2MB. Free memory was 56.7MB in the beginning and 55.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:54:27,314 INFO L158 Benchmark]: RCFGBuilder took 271.57ms. Allocated memory is still 90.2MB. Free memory was 55.5MB in the beginning and 42.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 04:54:27,314 INFO L158 Benchmark]: BuchiAutomizer took 7765.80ms. Allocated memory was 90.2MB in the beginning and 159.4MB in the end (delta: 69.2MB). Free memory was 42.9MB in the beginning and 72.7MB in the end (delta: -29.8MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. [2022-07-13 04:54:27,315 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.13ms. Allocated memory is still 90.2MB. Free memory is still 69.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.60ms. Allocated memory is still 90.2MB. Free memory was 52.3MB in the beginning and 58.8MB in the end (delta: -6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.79ms. Allocated memory is still 90.2MB. Free memory was 58.8MB in the beginning and 56.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.96ms. Allocated memory is still 90.2MB. Free memory was 56.7MB in the beginning and 55.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 271.57ms. Allocated memory is still 90.2MB. Free memory was 55.5MB in the beginning and 42.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 7765.80ms. Allocated memory was 90.2MB in the beginning and 159.4MB in the end (delta: 69.2MB). Free memory was 42.9MB in the beginning and 72.7MB in the end (delta: -29.8MB). Peak memory consumption was 70.5MB. 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-13 04:54:27,340 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